TSTP Solution File: SYN075+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:40 EDT 2022
% Result : Theorem 0.21s 1.37s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 28 ( 3 unt; 0 def)
% Number of atoms : 78 ( 56 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 80 ( 30 ~; 39 |; 6 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 8 sgn 14 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel52,conjecture,
? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel52) ).
fof(pel52_1,axiom,
? [X1,X2] :
! [X3,X4] :
( big_f(X3,X4)
<=> ( X3 = X1
& X4 = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel52_1) ).
fof(c_0_2,negated_conjecture,
~ ? [X2] :
! [X4] :
( ? [X1] :
! [X3] :
( big_f(X3,X4)
<=> X3 = X1 )
<=> X4 = X2 ),
inference(assume_negation,[status(cth)],[pel52]) ).
fof(c_0_3,negated_conjecture,
! [X5,X7,X10,X10] :
( ( ~ big_f(esk2_2(X5,X7),esk1_1(X5))
| esk2_2(X5,X7) != X7
| esk1_1(X5) != X5 )
& ( big_f(esk2_2(X5,X7),esk1_1(X5))
| esk2_2(X5,X7) = X7
| esk1_1(X5) != X5 )
& ( ~ big_f(X10,esk1_1(X5))
| X10 = esk3_1(X5)
| esk1_1(X5) = X5 )
& ( X10 != esk3_1(X5)
| big_f(X10,esk1_1(X5))
| esk1_1(X5) = 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)],[c_0_2])])])])])])]) ).
fof(c_0_4,plain,
! [X7,X8,X7,X8] :
( ( X7 = esk4_0
| ~ big_f(X7,X8) )
& ( X8 = esk5_0
| ~ big_f(X7,X8) )
& ( X7 != esk4_0
| X8 != esk5_0
| big_f(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel52_1])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( esk1_1(X1) = X1
| big_f(X2,esk1_1(X1))
| X2 != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X2 = esk5_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk1_1(X1) = X1
| big_f(esk3_1(X1),esk1_1(X1)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( esk2_2(X1,X2) = X2
| big_f(esk2_2(X1,X2),esk1_1(X1))
| esk1_1(X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( esk1_1(X1) = esk5_0
| esk1_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( X1 = esk4_0
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( esk1_1(X1) != X1
| esk2_2(X1,X2) != X2
| ~ big_f(esk2_2(X1,X2),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_12,negated_conjecture,
( esk2_2(X1,X2) = X2
| esk1_1(X1) = esk5_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( esk3_1(X1) = esk4_0
| esk1_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( esk1_1(X1) = esk5_0
| ~ big_f(esk2_2(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( esk1_1(X1) = X1
| big_f(esk4_0,esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( esk1_1(X1) = X1
| esk5_0 != X1 ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( esk1_1(X1) = esk5_0
| ~ big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( esk1_1(X1) = X1
| big_f(esk4_0,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( esk1_1(esk5_0) = esk5_0
| esk1_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( esk2_2(X1,X2) = esk4_0
| esk2_2(X1,X2) = X2
| esk1_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
esk1_1(esk5_0) = esk5_0,
inference(ef,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
( big_f(X1,X2)
| X2 != esk5_0
| X1 != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk2_2(esk5_0,X1) = esk4_0
| esk2_2(esk5_0,X1) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( esk2_2(X1,X2) != esk4_0
| esk2_2(X1,X2) != X2
| esk1_1(X1) != esk5_0
| esk1_1(X1) != X1 ),
inference(spm,[status(thm)],[c_0_11,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( esk2_2(esk5_0,X1) = esk4_0
| X1 != esk4_0 ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
esk4_0 != X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN075+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.10 % Command : run_ET %s %d
% 0.10/0.31 % Computer : n014.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Tue Jul 12 05:34:49 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.21/1.37 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.37 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.37 # Preprocessing time : 0.012 s
% 0.21/1.37
% 0.21/1.37 # Proof found!
% 0.21/1.37 # SZS status Theorem
% 0.21/1.37 # SZS output start CNFRefutation
% See solution above
% 0.21/1.37 # Proof object total steps : 28
% 0.21/1.37 # Proof object clause steps : 23
% 0.21/1.37 # Proof object formula steps : 5
% 0.21/1.37 # Proof object conjectures : 23
% 0.21/1.37 # Proof object clause conjectures : 20
% 0.21/1.37 # Proof object formula conjectures : 3
% 0.21/1.37 # Proof object initial clauses used : 6
% 0.21/1.37 # Proof object initial formulas used : 2
% 0.21/1.37 # Proof object generating inferences : 17
% 0.21/1.37 # Proof object simplifying inferences : 5
% 0.21/1.37 # Training examples: 0 positive, 0 negative
% 0.21/1.37 # Parsed axioms : 2
% 0.21/1.37 # Removed by relevancy pruning/SinE : 0
% 0.21/1.37 # Initial clauses : 7
% 0.21/1.37 # Removed in clause preprocessing : 0
% 0.21/1.37 # Initial clauses in saturation : 7
% 0.21/1.37 # Processed clauses : 51
% 0.21/1.37 # ...of these trivial : 1
% 0.21/1.37 # ...subsumed : 16
% 0.21/1.37 # ...remaining for further processing : 34
% 0.21/1.37 # Other redundant clauses eliminated : 0
% 0.21/1.37 # Clauses deleted for lack of memory : 0
% 0.21/1.37 # Backward-subsumed : 2
% 0.21/1.37 # Backward-rewritten : 0
% 0.21/1.37 # Generated clauses : 131
% 0.21/1.37 # ...of the previous two non-trivial : 108
% 0.21/1.37 # Contextual simplify-reflections : 16
% 0.21/1.37 # Paramodulations : 120
% 0.21/1.37 # Factorizations : 6
% 0.21/1.37 # Equation resolutions : 3
% 0.21/1.37 # Current number of processed clauses : 30
% 0.21/1.37 # Positive orientable unit clauses : 1
% 0.21/1.37 # Positive unorientable unit clauses: 0
% 0.21/1.37 # Negative unit clauses : 1
% 0.21/1.37 # Non-unit-clauses : 28
% 0.21/1.37 # Current number of unprocessed clauses: 43
% 0.21/1.37 # ...number of literals in the above : 123
% 0.21/1.37 # Current number of archived formulas : 0
% 0.21/1.37 # Current number of archived clauses : 4
% 0.21/1.37 # Clause-clause subsumption calls (NU) : 103
% 0.21/1.37 # Rec. Clause-clause subsumption calls : 95
% 0.21/1.37 # Non-unit clause-clause subsumptions : 33
% 0.21/1.37 # Unit Clause-clause subsumption calls : 7
% 0.21/1.37 # Rewrite failures with RHS unbound : 0
% 0.21/1.37 # BW rewrite match attempts : 1
% 0.21/1.37 # BW rewrite match successes : 1
% 0.21/1.37 # Condensation attempts : 0
% 0.21/1.37 # Condensation successes : 0
% 0.21/1.37 # Termbank termtop insertions : 1586
% 0.21/1.37
% 0.21/1.37 # -------------------------------------------------
% 0.21/1.37 # User time : 0.014 s
% 0.21/1.37 # System time : 0.001 s
% 0.21/1.37 # Total time : 0.015 s
% 0.21/1.37 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------