%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU131+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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:00 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 51 ( 17 unt; 0 def)
% Number of atoms : 128 ( 43 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 125 ( 48 ~; 61 |; 9 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 85 ( 16 sgn 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t3_boole,axiom,
! [X1] : set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_boole) ).
fof(l32_xboole_1,conjecture,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l32_xboole_1) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(t4_boole,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_boole) ).
fof(c_0_7,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_8,plain,
empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_9,plain,
! [X2] : set_difference(X2,empty_set) = X2,
inference(variable_rename,[status(thm)],[t3_boole]) ).
cnf(c_0_10,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
inference(assume_negation,[status(cth)],[l32_xboole_1]) ).
fof(c_0_13,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(esk4_3(X5,X6,X7),X7)
| ~ in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X6)
| in(esk4_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_14,plain,
set_difference(X1,empty_set) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
empty_set = esk6_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_16,negated_conjecture,
( ( set_difference(esk1_0,esk2_0) != empty_set
| ~ subset(esk1_0,esk2_0) )
& ( set_difference(esk1_0,esk2_0) = empty_set
| subset(esk1_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_17,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
set_difference(X1,esk6_0) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk3_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])])])])])])]) ).
cnf(c_0_20,negated_conjecture,
( subset(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ in(X1,esk6_0)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk6_0
| subset(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,plain,
( subset(esk6_0,X1)
| ~ in(esk3_2(esk6_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_26,plain,
! [X2] : set_difference(empty_set,X2) = empty_set,
inference(variable_rename,[status(thm)],[t4_boole]) ).
cnf(c_0_27,plain,
( X1 = set_difference(X2,X3)
| in(esk4_3(X2,X3,X1),X1)
| in(esk4_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_28,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk6_0
| in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
subset(esk6_0,X1),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_30,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( set_difference(X1,X2) = esk6_0
| in(esk4_3(X1,X2,esk6_0),X1)
| ~ in(esk4_3(X1,X2,esk6_0),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk6_0
| X1 = set_difference(esk1_0,X2)
| in(esk4_3(esk1_0,X2,X1),esk2_0)
| in(esk4_3(esk1_0,X2,X1),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,plain,
~ in(X1,esk6_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_21]) ).
cnf(c_0_34,plain,
( in(X4,X2)
| X1 != set_difference(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
set_difference(esk6_0,X1) = esk6_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_15]),c_0_15]) ).
cnf(c_0_36,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk6_0
| set_difference(esk1_0,X1) = esk6_0
| in(esk4_3(esk1_0,X1,esk6_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,plain,
( X1 != esk6_0
| ~ in(X2,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21]) ).
cnf(c_0_39,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( X1 = set_difference(X2,X3)
| in(esk4_3(X2,X3,X1),X1)
| ~ in(esk4_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk6_0
| set_difference(esk1_0,X1) = esk6_0
| in(esk4_3(esk1_0,X1,esk6_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_42,plain,
( in(X1,X2)
| set_difference(X3,X2) != esk6_0
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
set_difference(esk1_0,esk2_0) = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( ~ subset(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_45,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_46,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( set_difference(esk1_0,esk2_0) != esk6_0
| ~ subset(esk1_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_44,c_0_15]) ).
cnf(c_0_48,negated_conjecture,
( subset(X1,esk2_0)
| ~ in(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_43])]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_22]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU131+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n025.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 Jun 19 07:16:58 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.015 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 : 51
% 0.22/1.40 # Proof object clause steps : 36
% 0.22/1.40 # Proof object formula steps : 15
% 0.22/1.40 # Proof object conjectures : 16
% 0.22/1.40 # Proof object clause conjectures : 13
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 14
% 0.22/1.40 # Proof object initial formulas used : 7
% 0.22/1.40 # Proof object generating inferences : 17
% 0.22/1.40 # Proof object simplifying inferences : 13
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 16
% 0.22/1.40 # Removed by relevancy pruning/SinE : 2
% 0.22/1.40 # Initial clauses : 23
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 23
% 0.22/1.40 # Processed clauses : 308
% 0.22/1.40 # ...of these trivial : 2
% 0.22/1.40 # ...subsumed : 151
% 0.22/1.40 # ...remaining for further processing : 155
% 0.22/1.40 # Other redundant clauses eliminated : 9
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 8
% 0.22/1.40 # Backward-rewritten : 53
% 0.22/1.40 # Generated clauses : 928
% 0.22/1.40 # ...of the previous two non-trivial : 841
% 0.22/1.40 # Contextual simplify-reflections : 83
% 0.22/1.40 # Paramodulations : 895
% 0.22/1.40 # Factorizations : 20
% 0.22/1.40 # Equation resolutions : 13
% 0.22/1.40 # Current number of processed clauses : 94
% 0.22/1.40 # Positive orientable unit clauses : 9
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 6
% 0.22/1.40 # Non-unit-clauses : 79
% 0.22/1.40 # Current number of unprocessed clauses: 419
% 0.22/1.40 # ...number of literals in the above : 1260
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 61
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 3282
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 2632
% 0.22/1.40 # Non-unit clause-clause subsumptions : 177
% 0.22/1.40 # Unit Clause-clause subsumption calls : 101
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 14
% 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 : 10222
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.040 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.042 s
% 0.22/1.40 # Maximum resident set size: 3568 pages
%------------------------------------------------------------------------------