%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU245+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:18:15 EDT 2022
% Result : Theorem 0.16s 1.35s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 135 ( 25 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 151 ( 57 ~; 64 |; 19 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 15 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_wellord1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).
fof(d6_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] : relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d6_wellord1) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t36_xboole_1) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
inference(assume_negation,[status(cth)],[t16_wellord1]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ relation(X3)
| relation_restriction(X3,X4) = set_intersection2(X3,cartesian_product2(X4,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_wellord1])])])])]) ).
fof(c_0_9,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
fof(c_0_10,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk33_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk33_2(X4,X5),X5)
| subset(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)],[d3_tarski])])])])])])]) ).
fof(c_0_11,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
fof(c_0_12,negated_conjecture,
( relation(esk3_0)
& ( ~ in(esk1_0,relation_restriction(esk3_0,esk2_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0)) )
& ( in(esk1_0,esk3_0)
| in(esk1_0,relation_restriction(esk3_0,esk2_0)) )
& ( in(esk1_0,cartesian_product2(esk2_0,esk2_0))
| in(esk1_0,relation_restriction(esk3_0,esk2_0)) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,plain,
( relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,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(esk34_3(X5,X6,X7),X7)
| ~ in(esk34_3(X5,X6,X7),X5)
| ~ in(esk34_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk34_3(X5,X6,X7),X5)
| in(esk34_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk34_3(X5,X6,X7),X6)
| in(esk34_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_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( relation_restriction(X1,X2) = set_difference(X1,set_difference(X1,cartesian_product2(X2,X2)))
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0))
| ~ in(esk1_0,esk3_0)
| ~ in(esk1_0,relation_restriction(esk3_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,lemma,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( in(esk1_0,set_difference(esk3_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0))))
| in(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_25,plain,
( in(X4,X3)
| X1 != set_difference(X2,set_difference(X2,X3))
| ~ in(X4,X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( in(esk1_0,relation_restriction(esk3_0,esk2_0))
| in(esk1_0,cartesian_product2(esk2_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X6)
| in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk41_3(X5,X6,X7),X7)
| ~ in(esk41_3(X5,X6,X7),X5)
| in(esk41_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk41_3(X5,X6,X7),X5)
| in(esk41_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk41_3(X5,X6,X7),X6)
| in(esk41_3(X5,X6,X7),X7)
| X7 = set_difference(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)],[inference(fof_simplification,[status(thm)],[d4_xboole_0])])])])])])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ in(esk1_0,set_difference(esk3_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0))))
| ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0))
| ~ in(esk1_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
in(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X3,set_difference(X3,X2))) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( in(esk1_0,set_difference(esk3_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0))))
| in(esk1_0,cartesian_product2(esk2_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_20])]) ).
cnf(c_0_32,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ in(esk1_0,set_difference(esk3_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0))))
| ~ in(esk1_0,cartesian_product2(esk2_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
in(esk1_0,cartesian_product2(esk2_0,esk2_0)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ in(esk1_0,set_difference(esk3_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ in(esk1_0,set_difference(esk3_0,cartesian_product2(esk2_0,esk2_0))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_29])]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU245+2 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.10 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 19 14:09:18 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.16/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.16/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.16/1.35 # Preprocessing time : 0.024 s
% 0.16/1.35
% 0.16/1.35 # Proof found!
% 0.16/1.35 # SZS status Theorem
% 0.16/1.35 # SZS output start CNFRefutation
% See solution above
% 0.16/1.35 # Proof object total steps : 41
% 0.16/1.35 # Proof object clause steps : 26
% 0.16/1.35 # Proof object formula steps : 15
% 0.16/1.35 # Proof object conjectures : 16
% 0.16/1.35 # Proof object clause conjectures : 13
% 0.16/1.35 # Proof object formula conjectures : 3
% 0.16/1.35 # Proof object initial clauses used : 11
% 0.16/1.35 # Proof object initial formulas used : 7
% 0.16/1.35 # Proof object generating inferences : 11
% 0.16/1.35 # Proof object simplifying inferences : 16
% 0.16/1.35 # Training examples: 0 positive, 0 negative
% 0.16/1.35 # Parsed axioms : 302
% 0.16/1.35 # Removed by relevancy pruning/SinE : 201
% 0.16/1.35 # Initial clauses : 196
% 0.16/1.35 # Removed in clause preprocessing : 3
% 0.16/1.35 # Initial clauses in saturation : 193
% 0.16/1.35 # Processed clauses : 1226
% 0.16/1.35 # ...of these trivial : 43
% 0.16/1.35 # ...subsumed : 626
% 0.16/1.35 # ...remaining for further processing : 557
% 0.16/1.35 # Other redundant clauses eliminated : 43
% 0.16/1.35 # Clauses deleted for lack of memory : 0
% 0.16/1.35 # Backward-subsumed : 3
% 0.16/1.35 # Backward-rewritten : 77
% 0.16/1.35 # Generated clauses : 5941
% 0.16/1.35 # ...of the previous two non-trivial : 4603
% 0.16/1.35 # Contextual simplify-reflections : 166
% 0.16/1.35 # Paramodulations : 5856
% 0.16/1.35 # Factorizations : 8
% 0.16/1.35 # Equation resolutions : 77
% 0.16/1.35 # Current number of processed clauses : 475
% 0.16/1.35 # Positive orientable unit clauses : 82
% 0.16/1.35 # Positive unorientable unit clauses: 1
% 0.16/1.35 # Negative unit clauses : 37
% 0.16/1.35 # Non-unit-clauses : 355
% 0.16/1.35 # Current number of unprocessed clauses: 3318
% 0.16/1.35 # ...number of literals in the above : 11486
% 0.16/1.35 # Current number of archived formulas : 0
% 0.16/1.35 # Current number of archived clauses : 81
% 0.16/1.35 # Clause-clause subsumption calls (NU) : 38955
% 0.16/1.35 # Rec. Clause-clause subsumption calls : 29045
% 0.16/1.35 # Non-unit clause-clause subsumptions : 498
% 0.16/1.35 # Unit Clause-clause subsumption calls : 5198
% 0.16/1.35 # Rewrite failures with RHS unbound : 0
% 0.16/1.35 # BW rewrite match attempts : 90
% 0.16/1.35 # BW rewrite match successes : 19
% 0.16/1.35 # Condensation attempts : 0
% 0.16/1.35 # Condensation successes : 0
% 0.16/1.35 # Termbank termtop insertions : 77703
% 0.16/1.35
% 0.16/1.35 # -------------------------------------------------
% 0.16/1.35 # User time : 0.128 s
% 0.16/1.35 # System time : 0.003 s
% 0.16/1.35 # Total time : 0.131 s
% 0.16/1.35 # Maximum resident set size: 7888 pages
% 0.16/23.37 eprover: CPU time limit exceeded, terminating
% 0.16/23.38 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.38 eprover: No such file or directory
% 0.16/23.39 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.39 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.40 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.41 eprover: No such file or directory
% 0.16/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.42 eprover: No such file or directory
% 0.16/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.42 eprover: No such file or directory
% 0.16/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.43 eprover: No such file or directory
% 0.16/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.43 eprover: No such file or directory
% 0.16/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.44 eprover: No such file or directory
%------------------------------------------------------------------------------