TSTP Solution File: SYN077+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:41 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 78 ( 6 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 100 ( 45 ~; 41 |; 9 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 52 ( 2 sgn 14 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel54,conjecture,
~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel54) ).
fof(pel54_1,axiom,
! [X1] :
? [X2] :
! [X3] :
( big_f(X3,X2)
<=> X3 = X1 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel54_1) ).
fof(c_0_2,negated_conjecture,
~ ~ ? [X4] :
! [X3] :
( big_f(X3,X4)
<=> ! [X5] :
( big_f(X3,X5)
=> ? [X1] :
( big_f(X1,X5)
& ~ ? [X2] :
( big_f(X2,X5)
& big_f(X2,X1) ) ) ) ),
inference(assume_negation,[status(cth)],[pel54]) ).
fof(c_0_3,negated_conjecture,
! [X7,X8,X10,X7,X12] :
( ( big_f(esk2_2(X7,X8),X8)
| ~ big_f(X7,X8)
| ~ big_f(X7,esk1_0) )
& ( ~ big_f(X10,X8)
| ~ big_f(X10,esk2_2(X7,X8))
| ~ big_f(X7,X8)
| ~ big_f(X7,esk1_0) )
& ( big_f(X7,esk3_1(X7))
| big_f(X7,esk1_0) )
& ( big_f(esk4_2(X7,X12),esk3_1(X7))
| ~ big_f(X12,esk3_1(X7))
| big_f(X7,esk1_0) )
& ( big_f(esk4_2(X7,X12),X12)
| ~ big_f(X12,esk3_1(X7))
| big_f(X7,esk1_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_2])])])])])])]) ).
fof(c_0_4,plain,
! [X4,X6,X6] :
( ( ~ big_f(X6,esk5_1(X4))
| X6 = X4 )
& ( X6 != X4
| big_f(X6,esk5_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel54_1])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(X1,esk1_0)
| ~ big_f(X1,X2)
| ~ big_f(X3,esk2_2(X1,X2))
| ~ big_f(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( big_f(X1,esk1_0)
| big_f(esk4_2(X1,X2),X2)
| ~ big_f(X2,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( X1 = X2
| ~ big_f(X1,esk5_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( big_f(esk2_2(X1,X2),X2)
| ~ big_f(X1,esk1_0)
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk4_2(X1,esk2_2(X2,X3)),X3)
| ~ big_f(esk2_2(X2,X3),esk3_1(X1))
| ~ big_f(X2,esk1_0)
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,esk1_0)
| big_f(esk4_2(X1,X2),esk3_1(X1))
| ~ big_f(X2,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( esk2_2(X1,esk5_1(X2)) = X2
| ~ big_f(X1,esk5_1(X2))
| ~ big_f(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( big_f(X1,esk5_1(X2))
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(X2,esk3_1(X1))
| ~ big_f(X2,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ~ big_f(X1,esk5_1(X2))
| ~ big_f(X3,esk5_1(X2))
| ~ big_f(X3,esk1_0)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
big_f(X1,esk5_1(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk4_2(X1,X2),esk1_0)
| ~ big_f(X2,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_f(X1,esk5_1(X2))
| ~ big_f(X1,esk1_0)
| ~ big_f(X2,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_f(X1,esk1_0)
| ~ big_f(esk1_0,esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( big_f(X1,esk1_0)
| big_f(X1,esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_20,negated_conjecture,
( ~ big_f(X1,esk1_0)
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
big_f(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN077+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n003.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 : Tue Jul 12 04:25:30 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.014 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 : 23
% 0.23/1.40 # Proof object clause steps : 18
% 0.23/1.40 # Proof object formula steps : 5
% 0.23/1.40 # Proof object conjectures : 18
% 0.23/1.40 # Proof object clause conjectures : 15
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 7
% 0.23/1.40 # Proof object initial formulas used : 2
% 0.23/1.40 # Proof object generating inferences : 10
% 0.23/1.40 # Proof object simplifying inferences : 4
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 2
% 0.23/1.40 # Removed by relevancy pruning/SinE : 0
% 0.23/1.40 # Initial clauses : 7
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 7
% 0.23/1.40 # Processed clauses : 37
% 0.23/1.40 # ...of these trivial : 0
% 0.23/1.40 # ...subsumed : 3
% 0.23/1.40 # ...remaining for further processing : 34
% 0.23/1.40 # Other redundant clauses eliminated : 1
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 2
% 0.23/1.40 # Backward-rewritten : 0
% 0.23/1.40 # Generated clauses : 48
% 0.23/1.40 # ...of the previous two non-trivial : 44
% 0.23/1.40 # Contextual simplify-reflections : 6
% 0.23/1.40 # Paramodulations : 47
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 1
% 0.23/1.40 # Current number of processed clauses : 31
% 0.23/1.40 # Positive orientable unit clauses : 2
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 0
% 0.23/1.40 # Non-unit-clauses : 29
% 0.23/1.40 # Current number of unprocessed clauses: 14
% 0.23/1.40 # ...number of literals in the above : 38
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 2
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 260
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 119
% 0.23/1.40 # Non-unit clause-clause subsumptions : 11
% 0.23/1.40 # Unit Clause-clause subsumption calls : 8
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 1
% 0.23/1.40 # BW rewrite match successes : 0
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 1598
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.013 s
% 0.23/1.40 # System time : 0.004 s
% 0.23/1.40 # Total time : 0.017 s
% 0.23/1.40 # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------