TSTP Solution File: SYN084+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:51:46 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 1
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 262 ( 0 equ)
% Maximal formula atoms : 114 ( 5 avg)
% Number of connectives : 336 ( 123 ~; 173 |; 34 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 40 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 25 ( 1 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel62,conjecture,
( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(f(X1)) ) )
=> big_p(f(f(X1))) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(f(f(X2))) )
& ( ~ big_p(a)
| ~ big_p(f(X2))
| big_p(f(f(X2))) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel62) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(f(X1)) ) )
=> big_p(f(f(X1))) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(f(f(X2))) )
& ( ~ big_p(a)
| ~ big_p(f(X2))
| big_p(f(f(X2))) ) ) ),
inference(assume_negation,[status(cth)],[pel62]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6,X6] :
( ( big_p(a)
| big_p(a)
| big_p(a) )
& ( big_p(f(esk3_0))
| big_p(a)
| big_p(a) )
& ( ~ big_p(f(f(esk3_0)))
| big_p(a)
| big_p(a) )
& ( big_p(a)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(f(esk3_0))
| ~ big_p(esk2_0)
| big_p(a) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( big_p(f(esk3_0))
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(f(f(esk2_0)))
| big_p(a) )
& ( big_p(a)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk3_0))
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk3_0)))
| big_p(a)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk3_0))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(f(esk3_0))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(esk1_0)
| big_p(f(esk1_0)) )
& ( big_p(a)
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk3_0))
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk3_0)))
| big_p(a)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk3_0))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk1_0))) )
& ( big_p(a)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( big_p(f(esk3_0))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(f(f(esk3_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk1_0))) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(f(f(X6)))
| big_p(X5)
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| ~ big_p(f(X6))
| big_p(f(f(X6)))
| big_p(X5)
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| big_p(X6)
| big_p(f(f(X6)))
| ~ big_p(f(X5))
| ~ big_p(a)
| big_p(f(f(X5))) )
& ( ~ big_p(a)
| ~ big_p(f(X6))
| big_p(f(f(X6)))
| ~ big_p(f(X5))
| ~ big_p(a)
| big_p(f(f(X5))) ) ),
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_p(f(f(X1)))
| big_p(X1)
| big_p(f(f(X2)))
| big_p(X2)
| ~ big_p(a)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_p(a)
| big_p(a)
| big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| ~ big_p(a)
| ~ big_p(f(X1))
| ~ big_p(f(X2))
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_p(X2)
| big_p(X1)
| big_p(f(f(X2)))
| big_p(f(f(X1)))
| ~ big_p(a) ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
big_p(a),
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( big_p(f(f(X2)))
| big_p(f(f(X1)))
| ~ big_p(a)
| ~ big_p(f(X2))
| ~ big_p(f(X1)) ),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| big_p(X1)
| big_p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(f(X2)))
| ~ big_p(f(X2))
| ~ big_p(f(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
( big_p(f(esk1_0))
| big_p(f(esk3_0))
| ~ big_p(esk1_0)
| ~ big_p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( big_p(f(f(X1)))
| big_p(X1) ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( big_p(f(esk3_0))
| ~ big_p(f(f(esk1_0)))
| ~ big_p(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( big_p(f(f(X1)))
| big_p(f(esk3_0))
| ~ big_p(f(X1))
| ~ big_p(esk2_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( big_p(f(esk3_0))
| ~ big_p(f(f(esk1_0)))
| ~ big_p(f(f(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_16,negated_conjecture,
( big_p(f(esk3_0))
| ~ big_p(f(esk1_0))
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( big_p(f(esk3_0))
| big_p(esk1_0)
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
( big_p(f(esk3_0))
| big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( big_p(f(esk3_0))
| ~ big_p(esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk3_0))) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(f(f(esk3_0)))
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
( big_p(f(esk3_0))
| big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(f(f(esk3_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_12]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( big_p(f(esk1_0))
| big_p(f(esk3_0))
| ~ big_p(esk1_0)
| ~ big_p(f(f(esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_27,negated_conjecture,
( big_p(f(f(X1)))
| big_p(esk1_0)
| ~ big_p(f(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( big_p(f(esk1_0))
| big_p(f(esk3_0))
| ~ big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_21]) ).
cnf(c_0_29,negated_conjecture,
big_p(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_27]),c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( big_p(f(f(esk1_0)))
| big_p(f(f(X1)))
| big_p(f(esk3_0))
| ~ big_p(f(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_28]),c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( big_p(f(esk3_0))
| big_p(f(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( big_p(f(f(esk1_0)))
| big_p(f(esk3_0)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
( big_p(f(esk3_0))
| ~ big_p(f(f(esk2_0))) ),
inference(spm,[status(thm)],[c_0_15,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(esk1_0)
| ~ big_p(f(f(esk2_0)))
| ~ big_p(f(f(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_35,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(esk1_0)
| ~ big_p(esk2_0)
| ~ big_p(f(f(esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_36,negated_conjecture,
big_p(f(esk3_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_12]),c_0_21]) ).
cnf(c_0_37,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(f(f(esk3_0)))
| ~ big_p(esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_12]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( big_p(f(f(esk3_0)))
| big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( big_p(f(esk1_0))
| ~ big_p(f(f(esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
big_p(f(f(esk3_0))),
inference(spm,[status(thm)],[c_0_38,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
big_p(f(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
( big_p(f(f(esk1_0)))
| big_p(f(f(X1)))
| ~ big_p(f(X1)) ),
inference(spm,[status(thm)],[c_0_10,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(f(f(esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
big_p(f(f(esk1_0))),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ big_p(f(f(esk1_0)))
| ~ big_p(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_40])]) ).
cnf(c_0_46,negated_conjecture,
~ big_p(f(f(esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,negated_conjecture,
~ big_p(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_44])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_12]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN084+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 12:54:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.016 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 49
% 0.23/1.40 # Proof object clause steps : 46
% 0.23/1.40 # Proof object formula steps : 3
% 0.23/1.40 # Proof object conjectures : 49
% 0.23/1.40 # Proof object clause conjectures : 46
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 11
% 0.23/1.40 # Proof object initial formulas used : 1
% 0.23/1.40 # Proof object generating inferences : 23
% 0.23/1.40 # Proof object simplifying inferences : 33
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 1
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 31
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 31
% 0.23/1.40 # Processed clauses : 83
% 0.23/1.40 # ...of these trivial : 19
% 0.23/1.40 # ...subsumed : 4
% 0.23/1.40 # ...remaining for further processing : 60
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 25
% 0.23/1.40 # Backward-rewritten : 21
% 0.23/1.40 # Generated clauses : 143
% 0.23/1.40 # ...of the previous two non-trivial : 142
% 0.23/1.40 # Contextual simplify-reflections : 21
% 0.23/1.40 # Paramodulations : 139
% 0.23/1.40 # Factorizations : 4
% 0.23/1.40 # Equation resolutions : 0
% 0.23/1.40 # Current number of processed clauses : 14
% 0.23/1.40 # Positive orientable unit clauses : 8
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 2
% 0.23/1.40 # Non-unit-clauses : 4
% 0.23/1.40 # Current number of unprocessed clauses: 9
% 0.23/1.40 # ...number of literals in the above : 29
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 46
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 314
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 237
% 0.23/1.40 # Non-unit clause-clause subsumptions : 48
% 0.23/1.40 # Unit Clause-clause subsumption calls : 11
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 24
% 0.23/1.40 # BW rewrite match successes : 6
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 3800
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.031 s
% 0.23/1.40 # System time : 0.001 s
% 0.23/1.40 # Total time : 0.032 s
% 0.23/1.40 # Maximum resident set size: 3024 pages
%------------------------------------------------------------------------------