TSTP Solution File: SET962+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET962+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:44 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 5 unt; 0 def)
% Number of atoms : 65 ( 16 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 65 ( 24 ~; 31 |; 5 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 11 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t115_zfmisc_1,conjecture,
! [X1,X2] :
( cartesian_product2(X1,X1) = cartesian_product2(X2,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t115_zfmisc_1) ).
fof(l55_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l55_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_3,negated_conjecture,
~ ! [X1,X2] :
( cartesian_product2(X1,X1) = cartesian_product2(X2,X2)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t115_zfmisc_1]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( in(X5,X7)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( in(X6,X8)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( ~ in(X5,X7)
| ~ in(X6,X8)
| in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])])])]) ).
fof(c_0_5,negated_conjecture,
( cartesian_product2(esk1_0,esk1_0) = cartesian_product2(esk2_0,esk2_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
cartesian_product2(esk1_0,esk1_0) = cartesian_product2(esk2_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( in(X1,esk1_0)
| ~ in(ordered_pair(X2,X1),cartesian_product2(esk2_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_10,plain,
! [X4,X5] :
( ( ~ in(esk3_2(X4,X5),X4)
| ~ in(esk3_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk3_2(X4,X5),X4)
| in(esk3_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_11,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0)
| ~ in(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( X1 = X2
| in(esk3_2(X1,X2),X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( X1 = esk2_0
| in(esk3_2(X1,esk2_0),X1)
| in(X2,esk1_0)
| ~ in(X2,esk2_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(X1,X2),cartesian_product2(esk2_0,esk2_0))
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( X1 = esk2_0
| X2 = esk2_0
| in(esk3_2(X1,esk2_0),esk1_0)
| in(esk3_2(X1,esk2_0),X1)
| in(esk3_2(X2,esk2_0),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X2,esk1_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
in(esk3_2(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( X1 = X2
| ~ in(esk3_2(X1,X2),X2)
| ~ in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
in(esk3_2(esk1_0,esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET962+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 18:01:47 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.014 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 24
% 0.25/1.43 # Proof object clause steps : 17
% 0.25/1.43 # Proof object formula steps : 7
% 0.25/1.43 # Proof object conjectures : 15
% 0.25/1.43 # Proof object clause conjectures : 12
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 7
% 0.25/1.43 # Proof object initial formulas used : 3
% 0.25/1.43 # Proof object generating inferences : 10
% 0.25/1.43 # Proof object simplifying inferences : 4
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 9
% 0.25/1.43 # Removed by relevancy pruning/SinE : 2
% 0.25/1.43 # Initial clauses : 11
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 11
% 0.25/1.43 # Processed clauses : 40
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 5
% 0.25/1.43 # ...remaining for further processing : 34
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 6
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 84
% 0.25/1.43 # ...of the previous two non-trivial : 74
% 0.25/1.43 # Contextual simplify-reflections : 1
% 0.25/1.43 # Paramodulations : 74
% 0.25/1.43 # Factorizations : 10
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 28
% 0.25/1.43 # Positive orientable unit clauses : 4
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 3
% 0.25/1.43 # Non-unit-clauses : 21
% 0.25/1.43 # Current number of unprocessed clauses: 22
% 0.25/1.43 # ...number of literals in the above : 84
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 6
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 202
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 167
% 0.25/1.43 # Non-unit clause-clause subsumptions : 11
% 0.25/1.43 # Unit Clause-clause subsumption calls : 7
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 1
% 0.25/1.43 # BW rewrite match successes : 1
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 1793
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.016 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.017 s
% 0.25/1.43 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------