TSTP Solution File: SYN374+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:45 EDT 2022
% Result : Theorem 0.27s 1.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 3 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 84 ( 27 ~; 44 |; 7 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 35 ( 18 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2125,conjecture,
( ? [X1] :
! [X2] :
( big_p(X1)
<=> big_p(X2) )
<=> ( ? [X1] : big_p(X1)
<=> ! [X2] : big_p(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',x2125) ).
fof(c_0_1,negated_conjecture,
~ ( ? [X1] :
! [X2] :
( big_p(X1)
<=> big_p(X2) )
<=> ( ? [X1] : big_p(X1)
<=> ! [X2] : big_p(X2) ) ),
inference(assume_negation,[status(cth)],[x2125]) ).
fof(c_0_2,negated_conjecture,
! [X3,X5,X8,X10,X10,X11,X12] :
( ( ~ big_p(X5)
| ~ big_p(esk2_0)
| ~ big_p(X3)
| ~ big_p(esk1_1(X3)) )
& ( big_p(esk3_0)
| big_p(X8)
| ~ big_p(X3)
| ~ big_p(esk1_1(X3)) )
& ( ~ big_p(X5)
| ~ big_p(esk2_0)
| big_p(X3)
| big_p(esk1_1(X3)) )
& ( big_p(esk3_0)
| big_p(X8)
| big_p(X3)
| big_p(esk1_1(X3)) )
& ( ~ big_p(X11)
| big_p(X12)
| ~ big_p(esk4_0)
| big_p(X10) )
& ( ~ big_p(esk5_0)
| big_p(esk6_0)
| ~ big_p(esk4_0)
| big_p(X10) )
& ( ~ big_p(X11)
| big_p(X12)
| ~ big_p(X10)
| big_p(esk4_0) )
& ( ~ big_p(esk5_0)
| big_p(esk6_0)
| ~ big_p(X10)
| big_p(esk4_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)],[c_0_1])])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_p(esk1_1(X1))
| big_p(X1)
| big_p(X2)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(esk4_0)
| big_p(X2)
| ~ big_p(X1)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_p(esk1_1(X1))
| big_p(esk3_0)
| big_p(X1) ),
inference(ef,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( big_p(esk4_0)
| big_p(X1)
| ~ big_p(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_4]),c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_p(esk4_0)
| big_p(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_5]),c_0_6]),c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(esk4_0)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
big_p(esk4_0),
inference(ef,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
( big_p(X1)
| big_p(X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ big_p(esk1_1(X1))
| ~ big_p(X1)
| ~ big_p(esk2_0)
| ~ big_p(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
big_p(X1),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN374+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 16:24:22 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.27/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.45 # Preprocessing time : 0.014 s
% 0.27/1.45
% 0.27/1.45 # Proof found!
% 0.27/1.45 # SZS status Theorem
% 0.27/1.45 # SZS output start CNFRefutation
% See solution above
% 0.27/1.45 # Proof object total steps : 15
% 0.27/1.45 # Proof object clause steps : 12
% 0.27/1.45 # Proof object formula steps : 3
% 0.27/1.45 # Proof object conjectures : 15
% 0.27/1.45 # Proof object clause conjectures : 12
% 0.27/1.45 # Proof object formula conjectures : 3
% 0.27/1.45 # Proof object initial clauses used : 4
% 0.27/1.45 # Proof object initial formulas used : 1
% 0.27/1.45 # Proof object generating inferences : 6
% 0.27/1.45 # Proof object simplifying inferences : 11
% 0.27/1.45 # Training examples: 0 positive, 0 negative
% 0.27/1.45 # Parsed axioms : 1
% 0.27/1.45 # Removed by relevancy pruning/SinE : 0
% 0.27/1.45 # Initial clauses : 8
% 0.27/1.45 # Removed in clause preprocessing : 0
% 0.27/1.45 # Initial clauses in saturation : 8
% 0.27/1.45 # Processed clauses : 16
% 0.27/1.45 # ...of these trivial : 0
% 0.27/1.45 # ...subsumed : 2
% 0.27/1.45 # ...remaining for further processing : 14
% 0.27/1.45 # Other redundant clauses eliminated : 0
% 0.27/1.45 # Clauses deleted for lack of memory : 0
% 0.27/1.45 # Backward-subsumed : 10
% 0.27/1.45 # Backward-rewritten : 3
% 0.27/1.45 # Generated clauses : 29
% 0.27/1.45 # ...of the previous two non-trivial : 26
% 0.27/1.45 # Contextual simplify-reflections : 6
% 0.27/1.45 # Paramodulations : 23
% 0.27/1.45 # Factorizations : 6
% 0.27/1.45 # Equation resolutions : 0
% 0.27/1.45 # Current number of processed clauses : 1
% 0.27/1.45 # Positive orientable unit clauses : 1
% 0.27/1.45 # Positive unorientable unit clauses: 0
% 0.27/1.45 # Negative unit clauses : 0
% 0.27/1.45 # Non-unit-clauses : 0
% 0.27/1.45 # Current number of unprocessed clauses: 0
% 0.27/1.45 # ...number of literals in the above : 0
% 0.27/1.45 # Current number of archived formulas : 0
% 0.27/1.45 # Current number of archived clauses : 13
% 0.27/1.45 # Clause-clause subsumption calls (NU) : 17
% 0.27/1.45 # Rec. Clause-clause subsumption calls : 16
% 0.27/1.45 # Non-unit clause-clause subsumptions : 16
% 0.27/1.45 # Unit Clause-clause subsumption calls : 2
% 0.27/1.45 # Rewrite failures with RHS unbound : 0
% 0.27/1.45 # BW rewrite match attempts : 6
% 0.27/1.45 # BW rewrite match successes : 6
% 0.27/1.45 # Condensation attempts : 0
% 0.27/1.45 # Condensation successes : 0
% 0.27/1.45 # Termbank termtop insertions : 1087
% 0.27/1.45
% 0.27/1.45 # -------------------------------------------------
% 0.27/1.45 # User time : 0.011 s
% 0.27/1.45 # System time : 0.004 s
% 0.27/1.45 # Total time : 0.015 s
% 0.27/1.45 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------