%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU157+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:15 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 31 ( 4 unt; 0 def)
% Number of atoms : 116 ( 46 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 144 ( 59 ~; 65 |; 15 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-4 aty)
% Number of variables : 105 ( 16 sgn 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_zfmisc_1) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_zfmisc_1) ).
fof(l55_zfmisc_1,conjecture,
! [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(c_0_3,plain,
! [X5,X6,X7,X8] :
( ( X5 = X7
| ordered_pair(X5,X6) != ordered_pair(X7,X8) )
& ( X6 = X8
| ordered_pair(X5,X6) != ordered_pair(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X10,X13,X14,X7,X8,X9,X16,X17] :
( ( in(esk5_4(X7,X8,X9,X10),X7)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( in(esk6_4(X7,X8,X9,X10),X8)
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( X10 = ordered_pair(esk5_4(X7,X8,X9,X10),esk6_4(X7,X8,X9,X10))
| ~ in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(X13,X7)
| ~ in(X14,X8)
| X10 != ordered_pair(X13,X14)
| in(X10,X9)
| X9 != cartesian_product2(X7,X8) )
& ( ~ in(esk7_3(X7,X8,X9),X9)
| ~ in(X16,X7)
| ~ in(X17,X8)
| esk7_3(X7,X8,X9) != ordered_pair(X16,X17)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk8_3(X7,X8,X9),X7)
| in(esk7_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( in(esk9_3(X7,X8,X9),X8)
| in(esk7_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) )
& ( esk7_3(X7,X8,X9) = ordered_pair(esk8_3(X7,X8,X9),esk9_3(X7,X8,X9))
| in(esk7_3(X7,X8,X9),X9)
| X9 = cartesian_product2(X7,X8) ) ),
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_zfmisc_1])])])])])])]) ).
cnf(c_0_5,plain,
( X2 = X4
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X4 = ordered_pair(esk5_4(X2,X3,X1,X4),esk6_4(X2,X3,X1,X4))
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = esk6_4(X2,X3,X4,X5)
| ordered_pair(X6,X1) != X5
| X4 != cartesian_product2(X2,X3)
| ~ in(X5,X4) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
inference(assume_negation,[status(cth)],[l55_zfmisc_1]) ).
cnf(c_0_9,plain,
( in(X4,X1)
| X1 != cartesian_product2(X2,X3)
| X4 != ordered_pair(X5,X6)
| ~ in(X6,X3)
| ~ in(X5,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( in(esk6_4(X2,X3,X1,X4),X3)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( esk6_4(X1,X2,X3,ordered_pair(X4,X5)) = X5
| X3 != cartesian_product2(X1,X2)
| ~ in(ordered_pair(X4,X5),X3) ),
inference(er,[status(thm)],[c_0_7]) ).
fof(c_0_12,negated_conjecture,
( ( ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk4_0) )
& ( in(esk1_0,esk3_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) )
& ( in(esk2_0,esk4_0)
| in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_13,plain,
( in(ordered_pair(X1,X2),X3)
| X3 != cartesian_product2(X4,X5)
| ~ in(X2,X5)
| ~ in(X1,X4) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| X3 != cartesian_product2(X4,X2)
| ~ in(ordered_pair(X5,X1),X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| in(esk2_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( X1 = X3
| ordered_pair(X1,X2) != ordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(esk2_0,esk4_0)
| ~ in(esk1_0,esk3_0)
| ~ in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( in(esk2_0,esk4_0)
| in(esk2_0,X1)
| cartesian_product2(esk3_0,esk4_0) != cartesian_product2(X2,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( X1 = esk5_4(X2,X3,X4,X5)
| ordered_pair(X1,X6) != X5
| X4 != cartesian_product2(X2,X3)
| ~ in(X5,X4) ),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(esk1_0,esk3_0)
| ~ in(esk2_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
in(esk2_0,esk4_0),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(esk5_4(X2,X3,X1,X4),X2)
| X1 != cartesian_product2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,plain,
( esk5_4(X1,X2,X3,ordered_pair(X4,X5)) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(ordered_pair(X4,X5),X3) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
| in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| X3 != cartesian_product2(X2,X4)
| ~ in(ordered_pair(X1,X5),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)),
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( in(esk1_0,X1)
| cartesian_product2(esk3_0,esk4_0) != cartesian_product2(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU157+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 19 11:45:23 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.014 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 31
% 0.21/1.40 # Proof object clause steps : 24
% 0.21/1.40 # Proof object formula steps : 7
% 0.21/1.40 # Proof object conjectures : 13
% 0.21/1.40 # Proof object clause conjectures : 10
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 9
% 0.21/1.40 # Proof object initial formulas used : 3
% 0.21/1.40 # Proof object generating inferences : 13
% 0.21/1.40 # Proof object simplifying inferences : 4
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 13
% 0.21/1.40 # Removed by relevancy pruning/SinE : 9
% 0.21/1.40 # Initial clauses : 14
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 14
% 0.21/1.40 # Processed clauses : 58
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 6
% 0.21/1.40 # ...remaining for further processing : 52
% 0.21/1.40 # Other redundant clauses eliminated : 3
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 3
% 0.21/1.40 # Backward-rewritten : 4
% 0.21/1.40 # Generated clauses : 116
% 0.21/1.40 # ...of the previous two non-trivial : 104
% 0.21/1.40 # Contextual simplify-reflections : 2
% 0.21/1.40 # Paramodulations : 97
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 18
% 0.21/1.40 # Current number of processed clauses : 44
% 0.21/1.40 # Positive orientable unit clauses : 2
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 3
% 0.21/1.40 # Non-unit-clauses : 39
% 0.21/1.40 # Current number of unprocessed clauses: 59
% 0.21/1.40 # ...number of literals in the above : 278
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 8
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 417
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 196
% 0.21/1.40 # Non-unit clause-clause subsumptions : 10
% 0.21/1.40 # Unit Clause-clause subsumption calls : 6
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 1
% 0.21/1.40 # BW rewrite match successes : 1
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 2449
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.016 s
% 0.21/1.40 # System time : 0.003 s
% 0.21/1.40 # Total time : 0.019 s
% 0.21/1.40 # Maximum resident set size: 2776 pages
%------------------------------------------------------------------------------