TSTP Solution File: SEU261+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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:23 EDT 2022
% Result : Theorem 0.25s 1.41s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 14 unt; 0 def)
% Number of atoms : 181 ( 0 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 209 ( 70 ~; 67 |; 37 &)
% ( 2 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 42 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t53_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t53_wellord1) ).
fof(t54_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t54_wellord1) ).
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(c_0_3,plain,
! [X1,X2] :
( epred1_2(X2,X1)
<=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ),
introduced(definition) ).
fof(c_0_4,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( relation_isomorphism(X1,X2,X3)
=> epred1_2(X2,X1) ) ) ) ),
inference(apply_def,[status(thm)],[t53_wellord1,c_0_3]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( ( well_ordering(X1)
& relation_isomorphism(X1,X2,X3) )
=> well_ordering(X2) ) ) ) ),
inference(assume_negation,[status(cth)],[t54_wellord1]) ).
fof(c_0_6,plain,
! [X1,X2] :
( epred1_2(X2,X1)
=> ( ( reflexive(X1)
=> reflexive(X2) )
& ( transitive(X1)
=> transitive(X2) )
& ( connected(X1)
=> connected(X2) )
& ( antisymmetric(X1)
=> antisymmetric(X2) )
& ( well_founded_relation(X1)
=> well_founded_relation(X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ relation(X4)
| ~ relation(X5)
| ~ relation(X6)
| ~ function(X6)
| ~ relation_isomorphism(X4,X5,X6)
| epred1_2(X5,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)],[c_0_4])])])])]) ).
fof(c_0_8,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& relation(esk3_0)
& function(esk3_0)
& well_ordering(esk1_0)
& relation_isomorphism(esk1_0,esk2_0,esk3_0)
& ~ well_ordering(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_5])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ( ~ reflexive(X3)
| reflexive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ transitive(X3)
| transitive(X4)
| ~ epred1_2(X4,X3) )
& ( ~ connected(X3)
| connected(X4)
| ~ epred1_2(X4,X3) )
& ( ~ antisymmetric(X3)
| antisymmetric(X4)
| ~ epred1_2(X4,X3) )
& ( ~ well_founded_relation(X3)
| well_founded_relation(X4)
| ~ epred1_2(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( epred1_2(X1,X2)
| ~ relation_isomorphism(X2,X1,X3)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation_isomorphism(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( well_founded_relation(X1)
| ~ epred1_2(X1,X2)
| ~ well_founded_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
epred1_2(esk2_0,esk1_0),
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_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
fof(c_0_18,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])])]) ).
cnf(c_0_19,plain,
( connected(X1)
| ~ epred1_2(X1,X2)
| ~ connected(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( antisymmetric(X1)
| ~ epred1_2(X1,X2)
| ~ antisymmetric(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( transitive(X1)
| ~ epred1_2(X1,X2)
| ~ transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( reflexive(X1)
| ~ epred1_2(X1,X2)
| ~ reflexive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( well_founded_relation(esk2_0)
| ~ well_founded_relation(esk1_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
well_ordering(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( connected(esk2_0)
| ~ connected(esk1_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_27,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( antisymmetric(esk2_0)
| ~ antisymmetric(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_29,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( transitive(esk2_0)
| ~ transitive(esk1_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_31,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( reflexive(esk2_0)
| ~ reflexive(esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_33,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,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_18]) ).
cnf(c_0_35,plain,
well_founded_relation(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_14])]) ).
cnf(c_0_36,plain,
connected(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]),c_0_14])]) ).
cnf(c_0_37,plain,
antisymmetric(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25]),c_0_14])]) ).
cnf(c_0_38,plain,
transitive(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_25]),c_0_14])]) ).
cnf(c_0_39,plain,
reflexive(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25]),c_0_14])]) ).
cnf(c_0_40,negated_conjecture,
~ well_ordering(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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]),c_0_38]),c_0_39]),c_0_15])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n005.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 16:11:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.41 # Preprocessing time : 0.014 s
% 0.25/1.41
% 0.25/1.41 # Proof found!
% 0.25/1.41 # SZS status Theorem
% 0.25/1.41 # SZS output start CNFRefutation
% See solution above
% 0.25/1.41 # Proof object total steps : 42
% 0.25/1.41 # Proof object clause steps : 31
% 0.25/1.41 # Proof object formula steps : 11
% 0.25/1.41 # Proof object conjectures : 11
% 0.25/1.41 # Proof object clause conjectures : 8
% 0.25/1.41 # Proof object formula conjectures : 3
% 0.25/1.41 # Proof object initial clauses used : 19
% 0.25/1.41 # Proof object initial formulas used : 3
% 0.25/1.41 # Proof object generating inferences : 12
% 0.25/1.41 # Proof object simplifying inferences : 27
% 0.25/1.41 # Training examples: 0 positive, 0 negative
% 0.25/1.41 # Parsed axioms : 4
% 0.25/1.41 # Removed by relevancy pruning/SinE : 0
% 0.25/1.41 # Initial clauses : 21
% 0.25/1.41 # Removed in clause preprocessing : 0
% 0.25/1.41 # Initial clauses in saturation : 21
% 0.25/1.41 # Processed clauses : 32
% 0.25/1.41 # ...of these trivial : 0
% 0.25/1.41 # ...subsumed : 0
% 0.25/1.41 # ...remaining for further processing : 32
% 0.25/1.41 # Other redundant clauses eliminated : 0
% 0.25/1.41 # Clauses deleted for lack of memory : 0
% 0.25/1.41 # Backward-subsumed : 0
% 0.25/1.41 # Backward-rewritten : 5
% 0.25/1.41 # Generated clauses : 13
% 0.25/1.41 # ...of the previous two non-trivial : 11
% 0.25/1.41 # Contextual simplify-reflections : 0
% 0.25/1.41 # Paramodulations : 13
% 0.25/1.41 # Factorizations : 0
% 0.25/1.41 # Equation resolutions : 0
% 0.25/1.41 # Current number of processed clauses : 27
% 0.25/1.41 # Positive orientable unit clauses : 14
% 0.25/1.41 # Positive unorientable unit clauses: 0
% 0.25/1.41 # Negative unit clauses : 1
% 0.25/1.41 # Non-unit-clauses : 12
% 0.25/1.41 # Current number of unprocessed clauses: 0
% 0.25/1.41 # ...number of literals in the above : 0
% 0.25/1.41 # Current number of archived formulas : 0
% 0.25/1.41 # Current number of archived clauses : 5
% 0.25/1.41 # Clause-clause subsumption calls (NU) : 5
% 0.25/1.41 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.41 # Non-unit clause-clause subsumptions : 0
% 0.25/1.41 # Unit Clause-clause subsumption calls : 0
% 0.25/1.41 # Rewrite failures with RHS unbound : 0
% 0.25/1.41 # BW rewrite match attempts : 5
% 0.25/1.41 # BW rewrite match successes : 5
% 0.25/1.41 # Condensation attempts : 0
% 0.25/1.41 # Condensation successes : 0
% 0.25/1.41 # Termbank termtop insertions : 1193
% 0.25/1.41
% 0.25/1.41 # -------------------------------------------------
% 0.25/1.41 # User time : 0.015 s
% 0.25/1.41 # System time : 0.000 s
% 0.25/1.41 # Total time : 0.015 s
% 0.25/1.41 # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------