## TSTP Solution File: SYN367+1 by CSE_E---1.4

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : CSE_E---1.4
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 21:10:26 EDT 2022

% Result   : Theorem 0.66s 0.73s
% Output   : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   32 (  10   ~;  11   |;   9   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   12 (   5 sgn   7   !;   0   ?)

%------------------------------------------------------------------------------
fof(x2118,conjecture,
( ! [X1] :
( ( p
& big_q(X1) )
| ( ~ p
& big_r(X1) ) )
=> ( ! [X1] : big_q(X1)
| ! [X1] : big_r(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2118) ).

fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ( p
& big_q(X1) )
| ( ~ p
& big_r(X1) ) )
=> ( ! [X1] : big_q(X1)
| ! [X1] : big_r(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2118])]) ).

fof(c_0_2,negated_conjecture,
! [X5] :
( ( ~ p
| p )
& ( big_r(X5)
| p )
& ( ~ p
| big_q(X5) )
& ( big_r(X5)
| big_q(X5) )
& ~ big_q(esk1_0)
& ~ big_r(esk2_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
( big_q(X1)
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
( big_r(X1)
| p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
~ big_q(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
( big_r(X1)
| big_q(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
~ big_r(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
big_r(X1),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.14  % Command   : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n010.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Sep  5 02:48:42 EDT 2022
% 0.13/0.35  % CPUTime  :
% 0.19/0.46  openjdk version "1.8.0_171"
% 0.19/0.46  OpenJDK Runtime Environment (build 1.8.0_171-b10)
% 0.19/0.46  OpenJDK 64-Bit Server VM (build 25.171-b10, mixed mode)
% 0.19/0.47  file=/export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.69  start to proof: theBenchmark
% 0.66/0.73  % Version  : CSE_E---1.4
% 0.66/0.73  % Problem  : theBenchmark.p
% 0.66/0.73  % Proof found
% 0.66/0.73  % SZS status Theorem for theBenchmark.p
% 0.66/0.73  % SZS output start Proof
% See solution above
% 0.66/0.73  % Total time : 0.031000 s
%------------------------------------------------------------------------------
```