TSTP Solution File: SET920+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET920+1 : TPTP v8.1.0. Released v3.2.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:55:27 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 78 ( 40 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 86 ( 31 ~; 37 |; 12 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 12 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t63_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_intersection2(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
=> in(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t63_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( set_intersection2(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
=> in(X1,X3) ),
inference(assume_negation,[status(cth)],[t63_zfmisc_1]) ).
fof(c_0_6,negated_conjecture,
( set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0)
& ~ in(esk1_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_8,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X6)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_10,negated_conjecture,
set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = unordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,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])])])])])])]) ).
cnf(c_0_14,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
set_intersection2(esk3_0,unordered_pair(esk2_0,esk1_0)) = unordered_pair(esk2_0,esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_12]) ).
cnf(c_0_16,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,esk3_0)
| X2 != unordered_pair(esk2_0,esk1_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk2_0,esk1_0)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET920+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 14:43:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 23
% 0.24/1.41 # Proof object clause steps : 12
% 0.24/1.41 # Proof object formula steps : 11
% 0.24/1.41 # Proof object conjectures : 9
% 0.24/1.41 # Proof object clause conjectures : 6
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 6
% 0.24/1.41 # Proof object initial formulas used : 5
% 0.24/1.41 # Proof object generating inferences : 4
% 0.24/1.41 # Proof object simplifying inferences : 5
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 9
% 0.24/1.41 # Removed by relevancy pruning/SinE : 2
% 0.24/1.41 # Initial clauses : 18
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 18
% 0.24/1.41 # Processed clauses : 27
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 1
% 0.24/1.41 # ...remaining for further processing : 26
% 0.24/1.41 # Other redundant clauses eliminated : 5
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 1
% 0.24/1.41 # Generated clauses : 71
% 0.24/1.41 # ...of the previous two non-trivial : 54
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 55
% 0.24/1.41 # Factorizations : 4
% 0.24/1.41 # Equation resolutions : 12
% 0.24/1.41 # Current number of processed clauses : 23
% 0.24/1.41 # Positive orientable unit clauses : 3
% 0.24/1.41 # Positive unorientable unit clauses: 2
% 0.24/1.41 # Negative unit clauses : 1
% 0.24/1.41 # Non-unit-clauses : 17
% 0.24/1.41 # Current number of unprocessed clauses: 45
% 0.24/1.41 # ...number of literals in the above : 134
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 1
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 54
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 49
% 0.24/1.41 # Non-unit clause-clause subsumptions : 1
% 0.24/1.41 # Unit Clause-clause subsumption calls : 3
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 6
% 0.24/1.41 # BW rewrite match successes : 4
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1558
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.016 s
% 0.24/1.41 # System time : 0.001 s
% 0.24/1.41 # Total time : 0.017 s
% 0.24/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------