TSTP Solution File: SEU230+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:05 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 17 unt; 0 def)
% Number of atoms : 25 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 5 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_ordinal1,conjecture,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_ordinal1) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_ordinal1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : in(X1,succ(X1)),
inference(assume_negation,[status(cth)],[t10_ordinal1]) ).
fof(c_0_6,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
fof(c_0_7,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_8,negated_conjecture,
~ in(esk1_0,succ(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
cnf(c_0_10,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_13,negated_conjecture,
~ in(esk1_0,succ(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,lemma,
in(X1,set_union2(singleton(X1),X2)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
~ in(esk1_0,set_union2(esk1_0,singleton(esk1_0))),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,lemma,
in(X1,set_union2(X2,singleton(X1))),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU230+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n021.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 : Mon Jun 20 11:50:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.027 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 20
% 0.26/1.43 # Proof object clause steps : 9
% 0.26/1.43 # Proof object formula steps : 11
% 0.26/1.43 # Proof object conjectures : 6
% 0.26/1.43 # Proof object clause conjectures : 3
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 5
% 0.26/1.43 # Proof object initial formulas used : 5
% 0.26/1.43 # Proof object generating inferences : 2
% 0.26/1.43 # Proof object simplifying inferences : 3
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 255
% 0.26/1.43 # Removed by relevancy pruning/SinE : 154
% 0.26/1.43 # Initial clauses : 175
% 0.26/1.43 # Removed in clause preprocessing : 4
% 0.26/1.43 # Initial clauses in saturation : 171
% 0.26/1.43 # Processed clauses : 258
% 0.26/1.43 # ...of these trivial : 14
% 0.26/1.43 # ...subsumed : 43
% 0.26/1.43 # ...remaining for further processing : 201
% 0.26/1.43 # Other redundant clauses eliminated : 38
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 39
% 0.26/1.43 # Generated clauses : 1027
% 0.26/1.43 # ...of the previous two non-trivial : 791
% 0.26/1.43 # Contextual simplify-reflections : 3
% 0.26/1.43 # Paramodulations : 962
% 0.26/1.43 # Factorizations : 14
% 0.26/1.43 # Equation resolutions : 51
% 0.26/1.43 # Current number of processed clauses : 159
% 0.26/1.43 # Positive orientable unit clauses : 36
% 0.26/1.43 # Positive unorientable unit clauses: 2
% 0.26/1.43 # Negative unit clauses : 13
% 0.26/1.43 # Non-unit-clauses : 108
% 0.26/1.43 # Current number of unprocessed clauses: 555
% 0.26/1.43 # ...number of literals in the above : 1714
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 41
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 1852
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 1225
% 0.26/1.43 # Non-unit clause-clause subsumptions : 27
% 0.26/1.43 # Unit Clause-clause subsumption calls : 879
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 50
% 0.26/1.43 # BW rewrite match successes : 23
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 20332
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.044 s
% 0.26/1.43 # System time : 0.007 s
% 0.26/1.43 # Total time : 0.051 s
% 0.26/1.43 # Maximum resident set size: 4288 pages
%------------------------------------------------------------------------------