TSTP Solution File: SEU309+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU309+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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.28s 1.45s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 39 ( 12 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 36 ( 16 ~; 10 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t22_pre_topc,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)) = X2 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t22_pre_topc) ).
fof(t17_pre_topc,lemma,
! [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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t17_pre_topc) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_subset_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)) = X2 ) ),
inference(assume_negation,[status(cth)],[t22_pre_topc]) ).
fof(c_0_5,negated_conjecture,
( one_sorted_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_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_4])])])])]) ).
fof(c_0_6,lemma,
! [X3,X4] :
( ~ one_sorted_str(X3)
| ~ element(X4,powerset(the_carrier(X3)))
| subset_complement(the_carrier(X3),X4) = subset_difference(the_carrier(X3),cast_as_carrier_subset(X3),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)],[t17_pre_topc])])])])]) ).
cnf(c_0_7,negated_conjecture,
subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0)) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,lemma,
( subset_complement(the_carrier(X1),X2) = subset_difference(the_carrier(X1),cast_as_carrier_subset(X1),X2)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( subset_complement(the_carrier(esk1_0),subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0)) != esk2_0
| ~ element(subset_difference(the_carrier(esk1_0),cast_as_carrier_subset(esk1_0),esk2_0),powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_11,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,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])]) ).
cnf(c_0_13,lemma,
( subset_complement(the_carrier(esk1_0),subset_complement(the_carrier(esk1_0),esk2_0)) != esk2_0
| ~ element(subset_complement(the_carrier(esk1_0),esk2_0),powerset(the_carrier(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_9]),c_0_11])]) ).
cnf(c_0_14,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,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])]) ).
cnf(c_0_16,lemma,
~ element(subset_complement(the_carrier(esk1_0),esk2_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_11])]) ).
cnf(c_0_17,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU309+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n024.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 03:46:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.28/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.45 # Preprocessing time : 0.042 s
% 0.28/1.45
% 0.28/1.45 # Proof found!
% 0.28/1.45 # SZS status Theorem
% 0.28/1.45 # SZS output start CNFRefutation
% See solution above
% 0.28/1.45 # Proof object total steps : 19
% 0.28/1.45 # Proof object clause steps : 10
% 0.28/1.45 # Proof object formula steps : 9
% 0.28/1.45 # Proof object conjectures : 7
% 0.28/1.45 # Proof object clause conjectures : 4
% 0.28/1.45 # Proof object formula conjectures : 3
% 0.28/1.45 # Proof object initial clauses used : 6
% 0.28/1.45 # Proof object initial formulas used : 4
% 0.28/1.45 # Proof object generating inferences : 4
% 0.28/1.45 # Proof object simplifying inferences : 9
% 0.28/1.45 # Training examples: 0 positive, 0 negative
% 0.28/1.45 # Parsed axioms : 496
% 0.28/1.45 # Removed by relevancy pruning/SinE : 395
% 0.28/1.45 # Initial clauses : 289
% 0.28/1.45 # Removed in clause preprocessing : 1
% 0.28/1.45 # Initial clauses in saturation : 288
% 0.28/1.45 # Processed clauses : 341
% 0.28/1.45 # ...of these trivial : 1
% 0.28/1.45 # ...subsumed : 33
% 0.28/1.45 # ...remaining for further processing : 307
% 0.28/1.45 # Other redundant clauses eliminated : 44
% 0.28/1.45 # Clauses deleted for lack of memory : 0
% 0.28/1.45 # Backward-subsumed : 0
% 0.28/1.45 # Backward-rewritten : 23
% 0.28/1.45 # Generated clauses : 1381
% 0.28/1.45 # ...of the previous two non-trivial : 1321
% 0.28/1.45 # Contextual simplify-reflections : 38
% 0.28/1.45 # Paramodulations : 1330
% 0.28/1.45 # Factorizations : 4
% 0.28/1.45 # Equation resolutions : 47
% 0.28/1.45 # Current number of processed clauses : 246
% 0.28/1.45 # Positive orientable unit clauses : 25
% 0.28/1.45 # Positive unorientable unit clauses: 0
% 0.28/1.45 # Negative unit clauses : 13
% 0.28/1.45 # Non-unit-clauses : 208
% 0.28/1.45 # Current number of unprocessed clauses: 1119
% 0.28/1.45 # ...number of literals in the above : 6433
% 0.28/1.45 # Current number of archived formulas : 0
% 0.28/1.45 # Current number of archived clauses : 24
% 0.28/1.45 # Clause-clause subsumption calls (NU) : 28729
% 0.28/1.45 # Rec. Clause-clause subsumption calls : 4401
% 0.28/1.45 # Non-unit clause-clause subsumptions : 69
% 0.28/1.45 # Unit Clause-clause subsumption calls : 1025
% 0.28/1.45 # Rewrite failures with RHS unbound : 0
% 0.28/1.45 # BW rewrite match attempts : 4
% 0.28/1.45 # BW rewrite match successes : 4
% 0.28/1.45 # Condensation attempts : 0
% 0.28/1.45 # Condensation successes : 0
% 0.28/1.45 # Termbank termtop insertions : 47146
% 0.28/1.45
% 0.28/1.45 # -------------------------------------------------
% 0.28/1.45 # User time : 0.096 s
% 0.28/1.45 # System time : 0.007 s
% 0.28/1.45 # Total time : 0.103 s
% 0.28/1.45 # Maximum resident set size: 5768 pages
%------------------------------------------------------------------------------