%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU275+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:31 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 22 ( 2 avg)
% Number of connectives : 73 ( 30 ~; 27 |; 10 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 24 ( 4 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t7_wellord2,conjecture,
! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_wellord2) ).
fof(d4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_ordering(X1)
<=> ( reflexive(X1)
& transitive(X1)
& antisymmetric(X1)
& connected(X1)
& well_founded_relation(X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_wellord1) ).
fof(t6_wellord2,lemma,
! [X1] :
( ordinal(X1)
=> well_founded_relation(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_wellord2) ).
fof(t2_wellord2,lemma,
! [X1] : reflexive(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_wellord2) ).
fof(t3_wellord2,lemma,
! [X1] : transitive(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_wellord2) ).
fof(t5_wellord2,lemma,
! [X1] : antisymmetric(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_wellord2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_wellord2) ).
fof(t4_wellord2,lemma,
! [X1] :
( ordinal(X1)
=> connected(inclusion_relation(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_wellord2) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> well_ordering(inclusion_relation(X1)) ),
inference(assume_negation,[status(cth)],[t7_wellord2]) ).
fof(c_0_9,plain,
! [X2] :
( ( reflexive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( transitive(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( antisymmetric(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( connected(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( well_founded_relation(X2)
| ~ well_ordering(X2)
| ~ relation(X2) )
& ( ~ reflexive(X2)
| ~ transitive(X2)
| ~ antisymmetric(X2)
| ~ connected(X2)
| ~ well_founded_relation(X2)
| well_ordering(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_wellord1])])]) ).
fof(c_0_10,lemma,
! [X2] :
( ~ ordinal(X2)
| well_founded_relation(inclusion_relation(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_wellord2])]) ).
fof(c_0_11,lemma,
! [X2] : reflexive(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[t2_wellord2]) ).
fof(c_0_12,lemma,
! [X2] : transitive(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[t3_wellord2]) ).
fof(c_0_13,lemma,
! [X2] : antisymmetric(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[t5_wellord2]) ).
fof(c_0_14,plain,
! [X2] : relation(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_15,lemma,
! [X2] :
( ~ ordinal(X2)
| connected(inclusion_relation(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_wellord2])]) ).
fof(c_0_16,negated_conjecture,
( ordinal(esk1_0)
& ~ well_ordering(inclusion_relation(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_17,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,lemma,
( well_founded_relation(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,lemma,
reflexive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,lemma,
transitive(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,lemma,
antisymmetric(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,lemma,
( connected(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
~ well_ordering(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,lemma,
( well_ordering(inclusion_relation(X1))
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
ordinal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU275+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.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:00:33 EDT 2022
% 0.13/0.34 % 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.033 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 : 28
% 0.25/1.44 # Proof object clause steps : 11
% 0.25/1.44 # Proof object formula steps : 17
% 0.25/1.44 # Proof object conjectures : 6
% 0.25/1.44 # Proof object clause conjectures : 3
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 9
% 0.25/1.44 # Proof object initial formulas used : 8
% 0.25/1.44 # Proof object generating inferences : 2
% 0.25/1.44 # Proof object simplifying inferences : 8
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 353
% 0.25/1.44 # Removed by relevancy pruning/SinE : 252
% 0.25/1.44 # Initial clauses : 196
% 0.25/1.44 # Removed in clause preprocessing : 3
% 0.25/1.44 # Initial clauses in saturation : 193
% 0.25/1.44 # Processed clauses : 203
% 0.25/1.44 # ...of these trivial : 1
% 0.25/1.44 # ...subsumed : 11
% 0.25/1.44 # ...remaining for further processing : 191
% 0.25/1.44 # Other redundant clauses eliminated : 25
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 0
% 0.25/1.44 # Backward-rewritten : 2
% 0.25/1.44 # Generated clauses : 1323
% 0.25/1.44 # ...of the previous two non-trivial : 1205
% 0.25/1.44 # Contextual simplify-reflections : 8
% 0.25/1.44 # Paramodulations : 1273
% 0.25/1.44 # Factorizations : 12
% 0.25/1.44 # Equation resolutions : 38
% 0.25/1.44 # Current number of processed clauses : 187
% 0.25/1.44 # Positive orientable unit clauses : 17
% 0.25/1.44 # Positive unorientable unit clauses: 2
% 0.25/1.44 # Negative unit clauses : 2
% 0.25/1.44 # Non-unit-clauses : 166
% 0.25/1.44 # Current number of unprocessed clauses: 1175
% 0.25/1.44 # ...number of literals in the above : 5327
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 3
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 4089
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 1516
% 0.25/1.44 # Non-unit clause-clause subsumptions : 19
% 0.25/1.44 # Unit Clause-clause subsumption calls : 29
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 50
% 0.25/1.44 # BW rewrite match successes : 24
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 36178
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.068 s
% 0.25/1.44 # System time : 0.006 s
% 0.25/1.44 # Total time : 0.074 s
% 0.25/1.44 # Maximum resident set size: 5380 pages
%------------------------------------------------------------------------------