TSTP Solution File: SEU159+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU159+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 09:17:17 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 99 ( 31 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 104 ( 37 ~; 50 |; 11 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 68 ( 10 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t38_zfmisc_1,conjecture,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t38_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
inference(assume_negation,[status(cth)],[t38_zfmisc_1]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk4_3(X5,X6,X7) != X5
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk4_3(X5,X6,X7) != X6
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X7)
| esk4_3(X5,X6,X7) = X5
| esk4_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
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)],[d2_tarski])])])])])])]) ).
fof(c_0_6,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk5_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk5_2(X4,X5),X5)
| subset(X4,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)],[d3_tarski])])])])])])]) ).
fof(c_0_7,negated_conjecture,
( ( ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk3_0) )
& ( in(esk1_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) )
& ( in(esk2_0,esk3_0)
| subset(unordered_pair(esk1_0,esk2_0),esk3_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| in(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_13,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( in(esk2_0,esk3_0)
| in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X3,X1)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
( ~ in(esk2_0,esk3_0)
| ~ in(esk1_0,esk3_0)
| ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
in(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( in(esk1_0,esk3_0)
| in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_23,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| ~ in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X1
| esk5_2(unordered_pair(X1,X2),X3) = X2
| subset(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( ~ subset(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_27,negated_conjecture,
in(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( esk5_2(unordered_pair(X1,X2),X3) = X1
| subset(unordered_pair(X1,X2),X3)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ subset(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_30,plain,
( subset(unordered_pair(X1,X2),X3)
| ~ in(X1,X3)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU159+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 22:53:03 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.015 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 32
% 0.25/1.42 # Proof object clause steps : 23
% 0.25/1.42 # Proof object formula steps : 9
% 0.25/1.42 # Proof object conjectures : 13
% 0.25/1.42 # Proof object clause conjectures : 10
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 9
% 0.25/1.42 # Proof object initial formulas used : 4
% 0.25/1.42 # Proof object generating inferences : 11
% 0.25/1.42 # Proof object simplifying inferences : 8
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 7
% 0.25/1.42 # Removed by relevancy pruning/SinE : 1
% 0.25/1.42 # Initial clauses : 15
% 0.25/1.42 # Removed in clause preprocessing : 0
% 0.25/1.42 # Initial clauses in saturation : 15
% 0.25/1.42 # Processed clauses : 59
% 0.25/1.42 # ...of these trivial : 1
% 0.25/1.42 # ...subsumed : 17
% 0.25/1.42 # ...remaining for further processing : 41
% 0.25/1.42 # Other redundant clauses eliminated : 4
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 1
% 0.25/1.42 # Backward-rewritten : 8
% 0.25/1.42 # Generated clauses : 85
% 0.25/1.42 # ...of the previous two non-trivial : 66
% 0.25/1.42 # Contextual simplify-reflections : 0
% 0.25/1.42 # Paramodulations : 76
% 0.25/1.42 # Factorizations : 2
% 0.25/1.42 # Equation resolutions : 7
% 0.25/1.42 # Current number of processed clauses : 30
% 0.25/1.42 # Positive orientable unit clauses : 5
% 0.25/1.42 # Positive unorientable unit clauses: 1
% 0.25/1.42 # Negative unit clauses : 5
% 0.25/1.42 # Non-unit-clauses : 19
% 0.25/1.42 # Current number of unprocessed clauses: 18
% 0.25/1.42 # ...number of literals in the above : 56
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 9
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 120
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 106
% 0.25/1.42 # Non-unit clause-clause subsumptions : 11
% 0.25/1.42 # Unit Clause-clause subsumption calls : 31
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 8
% 0.25/1.42 # BW rewrite match successes : 4
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 1653
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.013 s
% 0.25/1.42 # System time : 0.005 s
% 0.25/1.42 # Total time : 0.018 s
% 0.25/1.42 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------