%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.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 09:17:26 EDT 2022
% Result : Theorem 0.20s 1.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 107 ( 25 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 118 ( 46 ~; 40 |; 16 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 8 sgn 36 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t50_subset_1,conjecture,
! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t50_subset_1) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_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(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_subset_1) ).
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(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(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(c_0_7,negated_conjecture,
~ ! [X1] :
( X1 != empty_set
=> ! [X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,X1)
=> ( ~ in(X3,X2)
=> in(X3,subset_complement(X1,X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[t50_subset_1]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_9,plain,
empty(esk8_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_10,plain,
! [X3,X4,X4,X3,X4,X4] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X4,X3)
| element(X4,X3)
| empty(X3) )
& ( ~ element(X4,X3)
| empty(X4)
| ~ empty(X3) )
& ( ~ empty(X4)
| element(X4,X3)
| ~ empty(X3) ) ),
inference(distribute,[status(thm)],[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)],[d2_subset_1])])])])])]) ).
fof(c_0_11,negated_conjecture,
( esk1_0 != empty_set
& element(esk2_0,powerset(esk1_0))
& element(esk3_0,esk1_0)
& ~ in(esk3_0,esk2_0)
& ~ in(esk3_0,subset_complement(esk1_0,esk2_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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])]) ).
fof(c_0_12,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_13,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
empty(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
element(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,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_19,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_20,plain,
( X1 = esk8_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( empty(esk1_0)
| in(esk3_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,plain,
empty_set = esk8_0,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
~ in(esk3_0,subset_complement(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( esk1_0 = esk8_0
| in(esk3_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
esk1_0 != esk8_0,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ in(esk3_0,set_difference(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
in(esk3_0,esk1_0),
inference(sr,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU171+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.11 % Command : run_ET %s %d
% 0.11/0.32 % Computer : n017.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 : Mon Jun 20 08:26:59 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.20/1.39 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39 # Preprocessing time : 0.017 s
% 0.20/1.39
% 0.20/1.39 # Proof found!
% 0.20/1.39 # SZS status Theorem
% 0.20/1.39 # SZS output start CNFRefutation
% See solution above
% 0.20/1.39 # Proof object total steps : 35
% 0.20/1.39 # Proof object clause steps : 20
% 0.20/1.39 # Proof object formula steps : 15
% 0.20/1.39 # Proof object conjectures : 14
% 0.20/1.39 # Proof object clause conjectures : 11
% 0.20/1.39 # Proof object formula conjectures : 3
% 0.20/1.39 # Proof object initial clauses used : 11
% 0.20/1.39 # Proof object initial formulas used : 7
% 0.20/1.39 # Proof object generating inferences : 7
% 0.20/1.39 # Proof object simplifying inferences : 7
% 0.20/1.39 # Training examples: 0 positive, 0 negative
% 0.20/1.39 # Parsed axioms : 23
% 0.20/1.39 # Removed by relevancy pruning/SinE : 4
% 0.20/1.39 # Initial clauses : 33
% 0.20/1.39 # Removed in clause preprocessing : 0
% 0.20/1.39 # Initial clauses in saturation : 33
% 0.20/1.39 # Processed clauses : 106
% 0.20/1.39 # ...of these trivial : 1
% 0.20/1.39 # ...subsumed : 24
% 0.20/1.39 # ...remaining for further processing : 81
% 0.20/1.39 # Other redundant clauses eliminated : 9
% 0.20/1.39 # Clauses deleted for lack of memory : 0
% 0.20/1.39 # Backward-subsumed : 0
% 0.20/1.39 # Backward-rewritten : 8
% 0.20/1.39 # Generated clauses : 180
% 0.20/1.39 # ...of the previous two non-trivial : 131
% 0.20/1.39 # Contextual simplify-reflections : 6
% 0.20/1.39 # Paramodulations : 164
% 0.20/1.39 # Factorizations : 2
% 0.20/1.39 # Equation resolutions : 13
% 0.20/1.39 # Current number of processed clauses : 72
% 0.20/1.39 # Positive orientable unit clauses : 15
% 0.20/1.39 # Positive unorientable unit clauses: 0
% 0.20/1.39 # Negative unit clauses : 14
% 0.20/1.39 # Non-unit-clauses : 43
% 0.20/1.39 # Current number of unprocessed clauses: 47
% 0.20/1.39 # ...number of literals in the above : 130
% 0.20/1.39 # Current number of archived formulas : 0
% 0.20/1.39 # Current number of archived clauses : 9
% 0.20/1.39 # Clause-clause subsumption calls (NU) : 243
% 0.20/1.39 # Rec. Clause-clause subsumption calls : 229
% 0.20/1.39 # Non-unit clause-clause subsumptions : 15
% 0.20/1.39 # Unit Clause-clause subsumption calls : 142
% 0.20/1.39 # Rewrite failures with RHS unbound : 0
% 0.20/1.39 # BW rewrite match attempts : 13
% 0.20/1.39 # BW rewrite match successes : 3
% 0.20/1.39 # Condensation attempts : 0
% 0.20/1.39 # Condensation successes : 0
% 0.20/1.39 # Termbank termtop insertions : 3199
% 0.20/1.39
% 0.20/1.39 # -------------------------------------------------
% 0.20/1.39 # User time : 0.022 s
% 0.20/1.39 # System time : 0.001 s
% 0.20/1.39 # Total time : 0.023 s
% 0.20/1.39 # Maximum resident set size: 3048 pages
%------------------------------------------------------------------------------