TSTP Solution File: SEU234+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU234+3 : TPTP v8.1.0. Released v3.2.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:08 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 5 unt; 0 def)
% Number of atoms : 110 ( 13 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 119 ( 41 ~; 50 |; 18 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 39 ( 2 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t31_ordinal1,conjecture,
! [X1] :
( ! [X2] :
( in(X2,X1)
=> ( ordinal(X2)
& subset(X2,X1) ) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t31_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_ordinal1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_ordinal1) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc2_ordinal1) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_ordinal1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( ! [X2] :
( in(X2,X1)
=> ( ordinal(X2)
& subset(X2,X1) ) )
=> ordinal(X1) ),
inference(assume_negation,[status(cth)],[t31_ordinal1]) ).
fof(c_0_6,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk4_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk4_1(X3),X3)
| epsilon_transitive(X3) ) ),
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)],[d2_ordinal1])])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X4] :
( ( ordinal(X4)
| ~ in(X4,esk1_0) )
& ( subset(X4,esk1_0)
| ~ in(X4,esk1_0) )
& ~ ordinal(esk1_0) ),
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)],[c_0_5])])])])])])]) ).
fof(c_0_8,plain,
! [X3,X4] :
( ~ ordinal(X3)
| ~ ordinal(X4)
| in(X3,X4)
| X3 = X4
| in(X4,X3) ),
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)],[inference(fof_simplification,[status(thm)],[t24_ordinal1])])])])])]) ).
fof(c_0_9,plain,
! [X2] :
( ~ epsilon_transitive(X2)
| ~ epsilon_connected(X2)
| ordinal(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_10,plain,
( epsilon_transitive(X1)
| ~ subset(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( subset(X1,esk1_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( epsilon_transitive(X1)
| in(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| X2 = X1
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_15,plain,
! [X4,X5,X6,X4] :
( ( ~ epsilon_connected(X4)
| ~ in(X5,X4)
| ~ in(X6,X4)
| in(X5,X6)
| X5 = X6
| in(X6,X5) )
& ( in(esk5_1(X4),X4)
| epsilon_connected(X4) )
& ( in(esk6_1(X4),X4)
| epsilon_connected(X4) )
& ( ~ in(esk5_1(X4),esk6_1(X4))
| epsilon_connected(X4) )
& ( esk5_1(X4) != esk6_1(X4)
| epsilon_connected(X4) )
& ( ~ in(esk6_1(X4),esk5_1(X4))
| epsilon_connected(X4) ) ),
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)],[d3_ordinal1])])])])])])])]) ).
cnf(c_0_16,plain,
( ordinal(X1)
| ~ epsilon_connected(X1)
| ~ epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
epsilon_transitive(esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
( X1 = X2
| in(X2,X1)
| in(X1,X2)
| ~ ordinal(X1)
| ~ in(X2,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( epsilon_connected(X1)
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ epsilon_connected(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( X1 = esk6_1(esk1_0)
| in(X1,esk6_1(esk1_0))
| in(esk6_1(esk1_0),X1)
| ~ ordinal(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( X1 = esk6_1(esk1_0)
| in(esk6_1(esk1_0),X1)
| in(X1,esk6_1(esk1_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_24,plain,
( epsilon_connected(X1)
| in(esk5_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
( epsilon_connected(X1)
| ~ in(esk6_1(X1),esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( esk6_1(esk1_0) = esk5_1(esk1_0)
| in(esk5_1(esk1_0),esk6_1(esk1_0))
| in(esk6_1(esk1_0),esk5_1(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_27,plain,
( epsilon_connected(X1)
| ~ in(esk5_1(X1),esk6_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( esk6_1(esk1_0) = esk5_1(esk1_0)
| in(esk5_1(esk1_0),esk6_1(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21]) ).
cnf(c_0_29,plain,
( epsilon_connected(X1)
| esk5_1(X1) != esk6_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_30,negated_conjecture,
esk6_1(esk1_0) = esk5_1(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU234+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.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 : Sun Jun 19 12:42:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.017 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 32
% 0.22/1.40 # Proof object clause steps : 21
% 0.22/1.40 # Proof object formula steps : 11
% 0.22/1.40 # Proof object conjectures : 15
% 0.22/1.40 # Proof object clause conjectures : 12
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 12
% 0.22/1.40 # Proof object initial formulas used : 5
% 0.22/1.40 # Proof object generating inferences : 9
% 0.22/1.40 # Proof object simplifying inferences : 7
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 39
% 0.22/1.40 # Removed by relevancy pruning/SinE : 17
% 0.22/1.40 # Initial clauses : 42
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 42
% 0.22/1.40 # Processed clauses : 3559
% 0.22/1.40 # ...of these trivial : 19
% 0.22/1.40 # ...subsumed : 2373
% 0.22/1.40 # ...remaining for further processing : 1167
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 77
% 0.22/1.40 # Backward-rewritten : 195
% 0.22/1.40 # Generated clauses : 23582
% 0.22/1.40 # ...of the previous two non-trivial : 21914
% 0.22/1.40 # Contextual simplify-reflections : 3562
% 0.22/1.40 # Paramodulations : 23577
% 0.22/1.40 # Factorizations : 4
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 894
% 0.22/1.40 # Positive orientable unit clauses : 19
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 11
% 0.22/1.40 # Non-unit-clauses : 864
% 0.22/1.40 # Current number of unprocessed clauses: 13049
% 0.22/1.40 # ...number of literals in the above : 70615
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 273
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 239934
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 72705
% 0.22/1.40 # Non-unit clause-clause subsumptions : 5254
% 0.22/1.40 # Unit Clause-clause subsumption calls : 1578
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 21
% 0.22/1.40 # BW rewrite match successes : 9
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 359054
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.523 s
% 0.22/1.40 # System time : 0.015 s
% 0.22/1.40 # Total time : 0.538 s
% 0.22/1.40 # Maximum resident set size: 18308 pages
%------------------------------------------------------------------------------