## TSTP Solution File: SYN367+1 by ET---2.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n022.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  : 600s
% DateTime : Thu Jul 21 05:53:42 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   5 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   32 (  11   ~;  10   |;   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   :   10 (   3 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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(assume_negation,[status(cth)],[x2118]) ).

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

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

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

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

cnf(c_0_6,negated_conjecture,
~ p,
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(sr,[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.07/0.13  % Problem  : SYN367+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 14:52:10 EDT 2022
% 0.13/0.35  % CPUTime  :
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.013 s
% 0.23/1.42
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 10
% 0.23/1.42  # Proof object clause steps            : 7
% 0.23/1.42  # Proof object formula steps           : 3
% 0.23/1.42  # Proof object conjectures             : 10
% 0.23/1.42  # Proof object clause conjectures      : 7
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 4
% 0.23/1.42  # Proof object initial formulas used   : 1
% 0.23/1.42  # Proof object generating inferences   : 1
% 0.23/1.42  # Proof object simplifying inferences  : 3
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 1
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.42  # Initial clauses                      : 6
% 0.23/1.42  # Removed in clause preprocessing      : 1
% 0.23/1.42  # Initial clauses in saturation        : 5
% 0.23/1.42  # Processed clauses                    : 8
% 0.23/1.42  # ...of these trivial                  : 0
% 0.23/1.42  # ...subsumed                          : 0
% 0.23/1.42  # ...remaining for further processing  : 8
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 3
% 0.23/1.42  # Generated clauses                    : 4
% 0.23/1.42  # ...of the previous two non-trivial   : 4
% 0.23/1.42  # Contextual simplify-reflections      : 0
% 0.23/1.42  # Paramodulations                      : 3
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.43  # Current number of processed clauses  : 4
% 0.23/1.43  #    Positive orientable unit clauses  : 1
% 0.23/1.43  #    Positive unorientable unit clauses: 0
% 0.23/1.43  #    Negative unit clauses             : 2
% 0.23/1.43  #    Non-unit-clauses                  : 1
% 0.23/1.43  # Current number of unprocessed clauses: 0
% 0.23/1.43  # ...number of literals in the above   : 0
% 0.23/1.43  # Current number of archived formulas  : 0
% 0.23/1.43  # Current number of archived clauses   : 4
% 0.23/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.43  # Unit Clause-clause subsumption calls : 1
% 0.23/1.43  # Rewrite failures with RHS unbound    : 0
% 0.23/1.43  # BW rewrite match attempts            : 3
% 0.23/1.43  # BW rewrite match successes           : 3
% 0.23/1.43  # Condensation attempts                : 0
% 0.23/1.43  # Condensation successes               : 0
% 0.23/1.43  # Termbank termtop insertions          : 236
% 0.23/1.43
% 0.23/1.43  # -------------------------------------------------
% 0.23/1.43  # User time                : 0.011 s
% 0.23/1.43  # System time              : 0.002 s
% 0.23/1.43  # Total time               : 0.014 s
% 0.23/1.43  # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------
```