%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU321+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:58 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 97 ( 11 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 112 ( 45 ~; 38 |; 15 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 49 ( 4 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l40_tops_1,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l40_tops_1) ).
fof(t54_subset_1,lemma,
! [X1,X2,X3] :
( element(X3,powerset(X1))
=> ~ ( in(X2,subset_complement(X1,X3))
& in(X2,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t54_subset_1) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_struct_0) ).
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(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
inference(assume_negation,[status(cth)],[l40_tops_1]) ).
fof(c_0_7,lemma,
! [X4,X5,X6] :
( ~ element(X6,powerset(X4))
| ~ in(X5,subset_complement(X4,X6))
| ~ in(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_subset_1])]) ).
fof(c_0_8,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& element(esk3_0,the_carrier(esk1_0))
& ( ~ in(esk3_0,subset_complement(the_carrier(esk1_0),esk2_0))
| in(esk3_0,esk2_0) )
& ( in(esk3_0,subset_complement(the_carrier(esk1_0),esk2_0))
| ~ in(esk3_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_6])])])])])]) ).
fof(c_0_9,plain,
! [X2] :
( empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ empty(the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_struct_0])])]) ).
fof(c_0_10,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])]) ).
cnf(c_0_11,lemma,
( ~ in(X1,X2)
| ~ in(X1,subset_complement(X3,X2))
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( in(esk3_0,subset_complement(the_carrier(esk1_0),esk2_0))
| ~ in(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,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(esk14_3(X5,X6,X7),X7)
| ~ in(esk14_3(X5,X6,X7),X5)
| in(esk14_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk14_3(X5,X6,X7),X5)
| in(esk14_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk14_3(X5,X6,X7),X6)
| in(esk14_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])])])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_16,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
( in(esk3_0,esk2_0)
| ~ in(esk3_0,subset_complement(the_carrier(esk1_0),esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_22,plain,
( in(X4,X1)
| in(X4,X3)
| X1 != set_difference(X2,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk3_0,set_difference(the_carrier(esk1_0),esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_13])]),c_0_21]) ).
cnf(c_0_27,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
in(esk3_0,the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU321+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n014.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 : Mon Jun 20 07:11:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.065 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 30
% 0.25/1.44 # Proof object clause steps : 17
% 0.25/1.44 # Proof object formula steps : 13
% 0.25/1.44 # Proof object conjectures : 14
% 0.25/1.44 # Proof object clause conjectures : 11
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 11
% 0.25/1.44 # Proof object initial formulas used : 6
% 0.25/1.44 # Proof object generating inferences : 6
% 0.25/1.44 # Proof object simplifying inferences : 11
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 523
% 0.25/1.44 # Removed by relevancy pruning/SinE : 422
% 0.25/1.44 # Initial clauses : 416
% 0.25/1.44 # Removed in clause preprocessing : 1
% 0.25/1.44 # Initial clauses in saturation : 415
% 0.25/1.44 # Processed clauses : 1915
% 0.25/1.44 # ...of these trivial : 26
% 0.25/1.44 # ...subsumed : 952
% 0.25/1.44 # ...remaining for further processing : 937
% 0.25/1.44 # Other redundant clauses eliminated : 97
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 30
% 0.25/1.44 # Backward-rewritten : 75
% 0.25/1.44 # Generated clauses : 8841
% 0.25/1.44 # ...of the previous two non-trivial : 8139
% 0.25/1.44 # Contextual simplify-reflections : 175
% 0.25/1.44 # Paramodulations : 8680
% 0.25/1.44 # Factorizations : 4
% 0.25/1.44 # Equation resolutions : 157
% 0.25/1.44 # Current number of processed clauses : 784
% 0.25/1.44 # Positive orientable unit clauses : 70
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 63
% 0.25/1.44 # Non-unit-clauses : 651
% 0.25/1.44 # Current number of unprocessed clauses: 5699
% 0.25/1.44 # ...number of literals in the above : 24957
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 106
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 118748
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 71590
% 0.25/1.44 # Non-unit clause-clause subsumptions : 708
% 0.25/1.44 # Unit Clause-clause subsumption calls : 16710
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 56
% 0.25/1.44 # BW rewrite match successes : 16
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 145722
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.318 s
% 0.25/1.44 # System time : 0.007 s
% 0.25/1.44 # Total time : 0.325 s
% 0.25/1.44 # Maximum resident set size: 10732 pages
%------------------------------------------------------------------------------