TSTP Solution File: SET047+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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:48:21 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 60 ( 23 ~; 29 |; 4 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel43,conjecture,
! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel43) ).
fof(pel43_1,axiom,
! [X1,X2] :
( set_equal(X1,X2)
<=> ! [X3] :
( element(X3,X1)
<=> element(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel43_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( set_equal(X1,X2)
<=> set_equal(X2,X1) ),
inference(assume_negation,[status(cth)],[pel43]) ).
fof(c_0_3,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ element(X6,X4)
| element(X6,X5)
| ~ set_equal(X4,X5) )
& ( ~ element(X6,X5)
| element(X6,X4)
| ~ set_equal(X4,X5) )
& ( ~ element(esk1_2(X4,X5),X4)
| ~ element(esk1_2(X4,X5),X5)
| set_equal(X4,X5) )
& ( element(esk1_2(X4,X5),X4)
| element(esk1_2(X4,X5),X5)
| set_equal(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)],[pel43_1])])])])])])]) ).
fof(c_0_4,negated_conjecture,
( ( ~ set_equal(esk2_0,esk3_0)
| ~ set_equal(esk3_0,esk2_0) )
& ( set_equal(esk2_0,esk3_0)
| set_equal(esk3_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
cnf(c_0_5,plain,
( element(X3,X2)
| ~ set_equal(X1,X2)
| ~ element(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
( set_equal(esk3_0,esk2_0)
| set_equal(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( element(X3,X1)
| ~ set_equal(X1,X2)
| ~ element(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
( element(X1,esk3_0)
| ~ element(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
( set_equal(X1,X2)
| element(esk1_2(X1,X2),X2)
| element(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,plain,
( set_equal(X1,X2)
| ~ element(esk1_2(X1,X2),X2)
| ~ element(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
( element(X1,esk2_0)
| ~ element(X1,esk3_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_6]),c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( element(esk1_2(X1,esk2_0),esk3_0)
| element(esk1_2(X1,esk2_0),X1)
| set_equal(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( set_equal(X1,esk2_0)
| ~ element(esk1_2(X1,esk2_0),esk3_0)
| ~ element(esk1_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
( element(esk1_2(esk3_0,esk2_0),esk3_0)
| set_equal(esk3_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ set_equal(esk3_0,esk2_0)
| ~ set_equal(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
set_equal(esk3_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( element(esk1_2(esk2_0,X1),esk3_0)
| element(esk1_2(esk2_0,X1),X1)
| set_equal(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
~ set_equal(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
element(esk1_2(esk2_0,esk3_0),esk3_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ element(esk1_2(esk2_0,esk3_0),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_19]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET047+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n019.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.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 18:08:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Failure: Out of unprocessed clauses!
% 0.23/1.41 # OLD status GaveUp
% 0.23/1.41 # Parsed axioms : 2
% 0.23/1.41 # Removed by relevancy pruning/SinE : 1
% 0.23/1.41 # Initial clauses : 2
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 2
% 0.23/1.41 # Processed clauses : 2
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 0
% 0.23/1.41 # ...remaining for further processing : 2
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 1
% 0.23/1.41 # ...of the previous two non-trivial : 0
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 1
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 2
% 0.23/1.41 # Positive orientable unit clauses : 0
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 2
% 0.23/1.41 # Current number of unprocessed clauses: 0
% 0.23/1.41 # ...number of literals in the above : 0
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 0
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41 # Non-unit clause-clause subsumptions : 0
% 0.23/1.41 # Unit Clause-clause subsumption calls : 0
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 0
% 0.23/1.41 # BW rewrite match successes : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 141
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.012 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.013 s
% 0.23/1.41 # Maximum resident set size: 2760 pages
% 0.23/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.013 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 22
% 0.23/1.41 # Proof object clause steps : 17
% 0.23/1.41 # Proof object formula steps : 5
% 0.23/1.41 # Proof object conjectures : 16
% 0.23/1.41 # Proof object clause conjectures : 13
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 6
% 0.23/1.41 # Proof object initial formulas used : 2
% 0.23/1.41 # Proof object generating inferences : 10
% 0.23/1.41 # Proof object simplifying inferences : 9
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 2
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 6
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 6
% 0.23/1.41 # Processed clauses : 26
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 4
% 0.23/1.41 # ...remaining for further processing : 20
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 5
% 0.23/1.41 # Generated clauses : 32
% 0.23/1.41 # ...of the previous two non-trivial : 23
% 0.23/1.41 # Contextual simplify-reflections : 5
% 0.23/1.41 # Paramodulations : 26
% 0.23/1.41 # Factorizations : 6
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 15
% 0.23/1.41 # Positive orientable unit clauses : 3
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 10
% 0.23/1.41 # Current number of unprocessed clauses: 2
% 0.23/1.41 # ...number of literals in the above : 4
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 5
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 33
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 23
% 0.23/1.41 # Non-unit clause-clause subsumptions : 9
% 0.23/1.41 # Unit Clause-clause subsumption calls : 3
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 772
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.014 s
% 0.23/1.41 # System time : 0.001 s
% 0.23/1.41 # Total time : 0.015 s
% 0.23/1.41 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------