%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU170+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:25 EDT 2022
% Result : Theorem 0.26s 1.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 48 ( 6 unt; 0 def)
% Number of atoms : 145 ( 16 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 159 ( 62 ~; 64 |; 18 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 101 ( 9 sgn 52 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_subset_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_subset_1) ).
fof(t43_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t43_subset_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(t3_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_0) ).
fof(l3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_subset_1) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,X4) = set_difference(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,subset_complement(X3,X4)) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| element(subset_complement(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t43_subset_1]) ).
fof(c_0_12,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(esk9_3(X5,X6,X7),X7)
| ~ in(esk9_3(X5,X6,X7),X5)
| in(esk9_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk9_3(X5,X6,X7),X5)
| in(esk9_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk9_3(X5,X6,X7),X6)
| in(esk9_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_13,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_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_17,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& element(esk3_0,powerset(esk1_0))
& ( ~ disjoint(esk2_0,esk3_0)
| ~ subset(esk2_0,subset_complement(esk1_0,esk3_0)) )
& ( disjoint(esk2_0,esk3_0)
| subset(esk2_0,subset_complement(esk1_0,esk3_0)) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])]) ).
cnf(c_0_18,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( set_difference(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( subset(esk2_0,subset_complement(esk1_0,esk3_0))
| disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X4,X5,X4,X5,X7] :
( ( in(esk5_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk5_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X7,X4)
| ~ in(X7,X5)
| ~ disjoint(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)],[inference(fof_simplification,[status(thm)],[t3_xboole_0])])])])])])])]) ).
fof(c_0_23,plain,
! [X4,X5,X6] :
( ~ element(X5,powerset(X4))
| ~ in(X6,X5)
| in(X6,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)],[l3_subset_1])])])])]) ).
cnf(c_0_24,plain,
( ~ element(X1,powerset(X2))
| ~ in(X3,subset_complement(X2,X1))
| ~ in(X3,X1) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
( disjoint(esk2_0,esk3_0)
| in(X1,subset_complement(esk1_0,esk3_0))
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
element(esk3_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_29,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(X1,esk3_0)
| ~ in(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]) ).
cnf(c_0_32,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( subset(X1,X2)
| ~ in(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
( ~ subset(esk2_0,subset_complement(esk1_0,esk3_0))
| ~ disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_38,negated_conjecture,
( disjoint(X1,esk3_0)
| ~ in(esk5_2(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( disjoint(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_40,plain,
( subset(X1,set_difference(X2,X3))
| in(esk4_2(X1,set_difference(X2,X3)),X3)
| ~ in(esk4_2(X1,set_difference(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( subset(esk2_0,X1)
| in(esk4_2(esk2_0,X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ~ disjoint(esk2_0,esk3_0)
| ~ subset(esk2_0,set_difference(esk1_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_13]),c_0_26])]) ).
cnf(c_0_43,negated_conjecture,
disjoint(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( subset(esk2_0,set_difference(esk1_0,X1))
| in(esk4_2(esk2_0,set_difference(esk1_0,X1)),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ subset(esk2_0,set_difference(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
~ in(esk4_2(esk2_0,set_difference(esk1_0,esk3_0)),esk2_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_44]),c_0_45]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU170+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 05:45:53 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.45 # Preprocessing time : 0.017 s
% 0.26/1.45
% 0.26/1.45 # Proof found!
% 0.26/1.45 # SZS status Theorem
% 0.26/1.45 # SZS output start CNFRefutation
% See solution above
% 0.26/1.45 # Proof object total steps : 48
% 0.26/1.45 # Proof object clause steps : 31
% 0.26/1.45 # Proof object formula steps : 17
% 0.26/1.45 # Proof object conjectures : 18
% 0.26/1.45 # Proof object clause conjectures : 15
% 0.26/1.45 # Proof object formula conjectures : 3
% 0.26/1.45 # Proof object initial clauses used : 16
% 0.26/1.45 # Proof object initial formulas used : 8
% 0.26/1.45 # Proof object generating inferences : 14
% 0.26/1.45 # Proof object simplifying inferences : 11
% 0.26/1.45 # Training examples: 0 positive, 0 negative
% 0.26/1.45 # Parsed axioms : 27
% 0.26/1.45 # Removed by relevancy pruning/SinE : 4
% 0.26/1.45 # Initial clauses : 37
% 0.26/1.45 # Removed in clause preprocessing : 0
% 0.26/1.45 # Initial clauses in saturation : 37
% 0.26/1.45 # Processed clauses : 5766
% 0.26/1.45 # ...of these trivial : 74
% 0.26/1.45 # ...subsumed : 4289
% 0.26/1.45 # ...remaining for further processing : 1403
% 0.26/1.45 # Other redundant clauses eliminated : 48
% 0.26/1.45 # Clauses deleted for lack of memory : 0
% 0.26/1.45 # Backward-subsumed : 65
% 0.26/1.45 # Backward-rewritten : 48
% 0.26/1.45 # Generated clauses : 53461
% 0.26/1.45 # ...of the previous two non-trivial : 43928
% 0.26/1.45 # Contextual simplify-reflections : 1716
% 0.26/1.45 # Paramodulations : 53252
% 0.26/1.45 # Factorizations : 148
% 0.26/1.45 # Equation resolutions : 59
% 0.26/1.45 # Current number of processed clauses : 1288
% 0.26/1.45 # Positive orientable unit clauses : 176
% 0.26/1.45 # Positive unorientable unit clauses: 0
% 0.26/1.45 # Negative unit clauses : 77
% 0.26/1.45 # Non-unit-clauses : 1035
% 0.26/1.45 # Current number of unprocessed clauses: 37584
% 0.26/1.45 # ...number of literals in the above : 132011
% 0.26/1.45 # Current number of archived formulas : 0
% 0.26/1.45 # Current number of archived clauses : 115
% 0.26/1.45 # Clause-clause subsumption calls (NU) : 247731
% 0.26/1.45 # Rec. Clause-clause subsumption calls : 199375
% 0.26/1.45 # Non-unit clause-clause subsumptions : 4669
% 0.26/1.45 # Unit Clause-clause subsumption calls : 5297
% 0.26/1.45 # Rewrite failures with RHS unbound : 0
% 0.26/1.45 # BW rewrite match attempts : 389
% 0.26/1.45 # BW rewrite match successes : 18
% 0.26/1.45 # Condensation attempts : 0
% 0.26/1.45 # Condensation successes : 0
% 0.26/1.45 # Termbank termtop insertions : 810061
% 0.26/1.45
% 0.26/1.45 # -------------------------------------------------
% 0.26/1.45 # User time : 0.900 s
% 0.26/1.45 # System time : 0.019 s
% 0.26/1.45 # Total time : 0.919 s
% 0.26/1.45 # Maximum resident set size: 36796 pages
% 0.26/23.46 eprover: CPU time limit exceeded, terminating
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51 eprover: No such file or directory
% 0.26/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.52 eprover: No such file or directory
% 0.26/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.53 eprover: No such file or directory
% 0.26/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.53 eprover: No such file or directory
% 0.26/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.26/23.54 eprover: No such file or directory
%------------------------------------------------------------------------------