TSTP Solution File: SET959+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.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 : Tue Jul 19 00:55:43 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 3 unt; 0 def)
% Number of atoms : 59 ( 19 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 68 ( 27 ~; 22 |; 13 &)
% ( 3 <=>; 3 =>; 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 2 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t112_zfmisc_1,conjecture,
! [X1,X2] :
( ( ! [X3] :
~ ( in(X3,X1)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
<=> in(ordered_pair(X3,X4),X2) ) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t112_zfmisc_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_tarski) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( ( ! [X3] :
~ ( in(X3,X1)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3] :
~ ( in(X3,X2)
& ! [X4,X5] : X3 != ordered_pair(X4,X5) )
& ! [X3,X4] :
( in(ordered_pair(X3,X4),X1)
<=> in(ordered_pair(X3,X4),X2) ) )
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t112_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
! [X8,X11,X14,X15,X14,X15] :
( ( ~ in(X8,esk1_0)
| X8 = ordered_pair(esk3_1(X8),esk4_1(X8)) )
& ( ~ in(X11,esk2_0)
| X11 = ordered_pair(esk5_1(X11),esk6_1(X11)) )
& ( ~ in(ordered_pair(X14,X15),esk1_0)
| in(ordered_pair(X14,X15),esk2_0) )
& ( ~ in(ordered_pair(X14,X15),esk2_0)
| in(ordered_pair(X14,X15),esk1_0) )
& esk1_0 != esk2_0 ),
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])])])])])]) ).
cnf(c_0_4,negated_conjecture,
( in(ordered_pair(X1,X2),esk1_0)
| ~ in(ordered_pair(X1,X2),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_5,negated_conjecture,
( X1 = ordered_pair(esk5_1(X1),esk6_1(X1))
| ~ in(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X4,X5] :
( ( ~ in(esk7_2(X4,X5),X4)
| ~ in(esk7_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk7_2(X4,X5),X4)
| in(esk7_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[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)],[t2_tarski])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( in(ordered_pair(X1,X2),esk2_0)
| ~ in(ordered_pair(X1,X2),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( X1 = ordered_pair(esk3_1(X1),esk4_1(X1))
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_10,plain,
( X1 = X2
| in(esk7_2(X1,X2),X2)
| in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ in(esk7_2(X1,X2),X2)
| ~ in(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( X1 = esk2_0
| in(esk7_2(X1,esk2_0),esk1_0)
| in(esk7_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
( X1 = esk2_0
| ~ in(esk7_2(X1,esk2_0),esk1_0)
| ~ in(esk7_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
in(esk7_2(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 17:09:25 EDT 2022
% 0.13/0.34 % 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.014 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 : 18
% 0.23/1.42 # Proof object clause steps : 13
% 0.23/1.42 # Proof object formula steps : 5
% 0.23/1.42 # Proof object conjectures : 14
% 0.23/1.42 # Proof object clause conjectures : 11
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 7
% 0.23/1.42 # Proof object initial formulas used : 2
% 0.23/1.42 # Proof object generating inferences : 6
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 8
% 0.23/1.42 # Removed by relevancy pruning/SinE : 2
% 0.23/1.42 # Initial clauses : 11
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 11
% 0.23/1.42 # Processed clauses : 22
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 21
% 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 : 2
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 32
% 0.23/1.42 # ...of the previous two non-trivial : 22
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 28
% 0.23/1.42 # Factorizations : 4
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 19
% 0.23/1.42 # Positive orientable unit clauses : 2
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 4
% 0.23/1.42 # Non-unit-clauses : 13
% 0.23/1.42 # Current number of unprocessed clauses: 10
% 0.23/1.42 # ...number of literals in the above : 23
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 2
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 56
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 51
% 0.23/1.42 # Non-unit clause-clause subsumptions : 3
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1127
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.015 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.016 s
% 0.23/1.42 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------