%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU308+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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:51 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 46 ( 15 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 41 ( 18 ~; 12 |; 3 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t17_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t17_pre_topc) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pre_topc) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k6_subset_1) ).
fof(dt_k2_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_pre_topc) ).
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(c_0_5,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2) ) ),
inference(assume_negation,[status(cth)],[t17_pre_topc]) ).
fof(c_0_6,negated_conjecture,
( one_sorted_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(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)],[c_0_5])])])])]) ).
fof(c_0_7,plain,
! [X2] :
( ~ one_sorted_str(X2)
| cast_as_carrier_subset(X2) = the_carrier(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
cnf(c_0_8,negated_conjecture,
subset_complement(the_carrier(esk1_0),esk2_0) != subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ element(X5,powerset(X4))
| ~ element(X6,powerset(X4))
| subset_difference(X4,X5,X6) = set_difference(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])]) ).
fof(c_0_12,plain,
! [X2] :
( ~ one_sorted_str(X2)
| element(cast_as_carrier_subset(X2),powerset(the_carrier(X2))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])]) ).
cnf(c_0_13,negated_conjecture,
subset_difference(the_carrier(esk1_0),the_carrier(esk1_0),esk2_0) != subset_complement(the_carrier(esk1_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_16,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_17,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
( subset_complement(the_carrier(esk1_0),esk2_0) != set_difference(the_carrier(esk1_0),esk2_0)
| ~ element(the_carrier(esk1_0),powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_19,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( element(the_carrier(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_21,negated_conjecture,
~ element(the_carrier(esk1_0),powerset(the_carrier(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU308+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 01:31:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.018 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 23
% 0.23/1.42 # Proof object clause steps : 12
% 0.23/1.42 # Proof object formula steps : 11
% 0.23/1.42 # Proof object conjectures : 10
% 0.23/1.42 # Proof object clause conjectures : 7
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 7
% 0.23/1.42 # Proof object initial formulas used : 5
% 0.23/1.42 # Proof object generating inferences : 5
% 0.23/1.42 # Proof object simplifying inferences : 7
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 53
% 0.23/1.42 # Removed by relevancy pruning/SinE : 23
% 0.23/1.42 # Initial clauses : 63
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 63
% 0.23/1.42 # Processed clauses : 76
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 1
% 0.23/1.42 # ...remaining for further processing : 75
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 137
% 0.23/1.42 # ...of the previous two non-trivial : 134
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 137
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 75
% 0.23/1.42 # Positive orientable unit clauses : 13
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 5
% 0.23/1.42 # Non-unit-clauses : 57
% 0.23/1.42 # Current number of unprocessed clauses: 121
% 0.23/1.42 # ...number of literals in the above : 307
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 86
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 81
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 17
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 4475
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.019 s
% 0.23/1.42 # System time : 0.003 s
% 0.23/1.42 # Total time : 0.022 s
% 0.23/1.42 # Maximum resident set size: 3052 pages
%------------------------------------------------------------------------------