TSTP Solution File: SET928+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:32 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 58 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 29 ~; 21 |; 8 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 4 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t72_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t72_zfmisc_1) ).
fof(t83_xboole_1,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t83_xboole_1) ).
fof(t55_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( disjoint(unordered_pair(X1,X2),X3)
& in(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t55_zfmisc_1) ).
fof(t57_zfmisc_1,axiom,
! [X1,X2,X3] :
~ ( ~ in(X1,X2)
& ~ in(X3,X2)
& ~ disjoint(unordered_pair(X1,X3),X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t57_zfmisc_1) ).
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_5,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
<=> ( ~ in(X1,X3)
& ~ in(X2,X3) ) ),
inference(assume_negation,[status(cth)],[t72_zfmisc_1]) ).
fof(c_0_6,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_difference(X3,X4) = X3 )
& ( set_difference(X3,X4) != X3
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])])]) ).
fof(c_0_7,negated_conjecture,
( ( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != unordered_pair(esk1_0,esk2_0)
| in(esk1_0,esk3_0)
| in(esk2_0,esk3_0) )
& ( ~ in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0) )
& ( ~ in(esk2_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ~ disjoint(unordered_pair(X4,X5),X6)
| ~ in(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_zfmisc_1])]) ).
cnf(c_0_9,plain,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0)
| ~ in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| ~ disjoint(unordered_pair(X1,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( in(esk2_0,esk3_0)
| in(esk1_0,esk3_0)
| set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) != unordered_pair(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ in(esk1_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( in(X4,X5)
| in(X6,X5)
| disjoint(unordered_pair(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t57_zfmisc_1])])]) ).
fof(c_0_16,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_17,negated_conjecture,
( set_difference(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0)
| ~ in(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( in(esk2_0,esk3_0)
| ~ disjoint(unordered_pair(esk1_0,esk2_0),esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
( disjoint(unordered_pair(X1,X2),X3)
| in(X2,X3)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( disjoint(unordered_pair(esk1_0,esk2_0),esk3_0)
| ~ in(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
in(esk2_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]) ).
cnf(c_0_23,plain,
( ~ disjoint(unordered_pair(X1,X2),X3)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
disjoint(unordered_pair(esk1_0,esk2_0),esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET928+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.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 : Sun Jul 10 18:57:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 26
% 0.22/1.40 # Proof object clause steps : 15
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 12
% 0.22/1.40 # Proof object clause conjectures : 9
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 8
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 6
% 0.22/1.40 # Proof object simplifying inferences : 7
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 9
% 0.22/1.40 # Removed by relevancy pruning/SinE : 2
% 0.22/1.40 # Initial clauses : 10
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 10
% 0.22/1.40 # Processed clauses : 24
% 0.22/1.40 # ...of these trivial : 1
% 0.22/1.40 # ...subsumed : 3
% 0.22/1.40 # ...remaining for further processing : 20
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 1
% 0.22/1.40 # Backward-rewritten : 4
% 0.22/1.40 # Generated clauses : 30
% 0.22/1.40 # ...of the previous two non-trivial : 24
% 0.22/1.40 # Contextual simplify-reflections : 1
% 0.22/1.40 # Paramodulations : 30
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 15
% 0.22/1.40 # Positive orientable unit clauses : 4
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 8
% 0.22/1.40 # Current number of unprocessed clauses: 9
% 0.22/1.40 # ...number of literals in the above : 24
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 5
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 9
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 6
% 0.22/1.40 # Non-unit clause-clause subsumptions : 2
% 0.22/1.40 # Unit Clause-clause subsumption calls : 5
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 4
% 0.22/1.40 # BW rewrite match successes : 4
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 1001
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.012 s
% 0.22/1.40 # System time : 0.004 s
% 0.22/1.40 # Total time : 0.016 s
% 0.22/1.40 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------