%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:21 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 4 unt; 0 def)
% Number of atoms : 153 ( 0 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 203 ( 89 ~; 86 |; 11 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 60 ( 8 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(t31_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> ( well_founded_relation(X2)
=> well_founded_relation(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t31_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_wellord1) ).
fof(t23_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t23_wellord1) ).
fof(t25_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t25_wellord1) ).
fof(t24_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_wellord1) ).
fof(t22_wellord1,axiom,
! [X1,X2] :
( relation(X2)
=> ( reflexive(X2)
=> reflexive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t22_wellord1) ).
fof(t32_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t32_wellord1) ).
fof(c_0_8,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_9,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ well_founded_relation(X4)
| well_founded_relation(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t31_wellord1])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])])]) ).
cnf(c_0_11,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_8]) ).
cnf(c_0_12,plain,
( well_founded_relation(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ connected(X4)
| connected(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_wellord1])]) ).
cnf(c_0_15,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
( connected(relation_restriction(X1,X2))
| ~ connected(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ antisymmetric(X4)
| antisymmetric(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t25_wellord1])]) ).
cnf(c_0_18,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( antisymmetric(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ transitive(X4)
| transitive(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_wellord1])]) ).
cnf(c_0_21,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(relation_restriction(X1,X2))
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( transitive(relation_restriction(X1,X2))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_23,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ reflexive(X4)
| reflexive(relation_restriction(X4,X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t22_wellord1])]) ).
fof(c_0_24,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( well_ordering(X2)
=> well_ordering(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t32_wellord1]) ).
cnf(c_0_25,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( reflexive(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_27,negated_conjecture,
( relation(esk2_0)
& well_ordering(esk2_0)
& ~ well_ordering(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_28,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_founded_relation(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ transitive(X1)
| ~ reflexive(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
~ well_ordering(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ well_ordering(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_36,negated_conjecture,
well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 20 04:20:14 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.014 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 39
% 0.26/1.44 # Proof object clause steps : 22
% 0.26/1.44 # Proof object formula steps : 17
% 0.26/1.44 # Proof object conjectures : 7
% 0.26/1.44 # Proof object clause conjectures : 4
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 15
% 0.26/1.44 # Proof object initial formulas used : 8
% 0.26/1.44 # Proof object generating inferences : 7
% 0.26/1.44 # Proof object simplifying inferences : 8
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 13
% 0.26/1.44 # Removed by relevancy pruning/SinE : 5
% 0.26/1.44 # Initial clauses : 15
% 0.26/1.44 # Removed in clause preprocessing : 0
% 0.26/1.44 # Initial clauses in saturation : 15
% 0.26/1.44 # Processed clauses : 21
% 0.26/1.44 # ...of these trivial : 0
% 0.26/1.44 # ...subsumed : 0
% 0.26/1.44 # ...remaining for further processing : 21
% 0.26/1.44 # Other redundant clauses eliminated : 0
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 0
% 0.26/1.44 # Backward-rewritten : 0
% 0.26/1.44 # Generated clauses : 13
% 0.26/1.44 # ...of the previous two non-trivial : 7
% 0.26/1.44 # Contextual simplify-reflections : 5
% 0.26/1.44 # Paramodulations : 13
% 0.26/1.44 # Factorizations : 0
% 0.26/1.44 # Equation resolutions : 0
% 0.26/1.44 # Current number of processed clauses : 21
% 0.26/1.44 # Positive orientable unit clauses : 2
% 0.26/1.44 # Positive unorientable unit clauses: 0
% 0.26/1.44 # Negative unit clauses : 1
% 0.26/1.44 # Non-unit-clauses : 18
% 0.26/1.44 # Current number of unprocessed clauses: 1
% 0.26/1.44 # ...number of literals in the above : 8
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 0
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 78
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 27
% 0.26/1.44 # Non-unit clause-clause subsumptions : 5
% 0.26/1.44 # Unit Clause-clause subsumption calls : 0
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 0
% 0.26/1.44 # BW rewrite match successes : 0
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 1332
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.012 s
% 0.26/1.44 # System time : 0.004 s
% 0.26/1.44 # Total time : 0.016 s
% 0.26/1.44 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------