TSTP Solution File: SEU244+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU244+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 08:40:01 EDT 2022
% Result : Theorem 9.47s 2.73s
% Output : CNFRefutation 9.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 25
% Syntax : Number of clauses : 69 ( 5 unt; 7 nHn; 69 RR)
% Number of literals : 224 ( 0 equ; 151 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_211,plain,
( well_orders(X1,X2)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,X2)
| ~ is_connected_in(X1,X2)
| ~ is_transitive_in(X1,X2)
| ~ is_reflexive_in(X1,X2)
| ~ is_well_founded_in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_211) ).
cnf(i_0_260,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_260) ).
cnf(i_0_68,plain,
( is_connected_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ connected(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_68) ).
cnf(i_0_69,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_69) ).
cnf(i_0_215,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_215) ).
cnf(i_0_47,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_47) ).
cnf(i_0_214,plain,
( is_antisymmetric_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_214) ).
cnf(i_0_67,plain,
( connected(X1)
| ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_67) ).
cnf(i_0_213,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_213) ).
cnf(i_0_590,lemma,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_590) ).
cnf(i_0_212,plain,
( is_well_founded_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_212) ).
cnf(i_0_259,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_259) ).
cnf(i_0_216,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_216) ).
cnf(i_0_48,plain,
( is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_48) ).
cnf(i_0_631,negated_conjecture,
( well_ordering(esk120_0)
| well_orders(esk120_0,relation_field(esk120_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_631) ).
cnf(i_0_633,negated_conjecture,
relation(esk120_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_633) ).
cnf(i_0_70,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ transitive(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_70) ).
cnf(i_0_187,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ well_founded_relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_187) ).
cnf(i_0_591,lemma,
( is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_591) ).
cnf(i_0_632,negated_conjecture,
( ~ well_ordering(esk120_0)
| ~ well_orders(esk120_0,relation_field(esk120_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_632) ).
cnf(i_0_192,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_192) ).
cnf(i_0_190,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_190) ).
cnf(i_0_189,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_189) ).
cnf(i_0_191,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_191) ).
cnf(i_0_188,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3pezo5dy/lgb.p',i_0_188) ).
cnf(c_0_659,plain,
( well_orders(X1,X2)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,X2)
| ~ is_connected_in(X1,X2)
| ~ is_transitive_in(X1,X2)
| ~ is_reflexive_in(X1,X2)
| ~ is_well_founded_in(X1,X2) ),
i_0_211 ).
cnf(c_0_660,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
i_0_260 ).
cnf(c_0_661,plain,
( well_orders(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ is_connected_in(X1,relation_field(X1))
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_659,c_0_660]) ).
cnf(c_0_662,plain,
( is_connected_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ connected(X1) ),
i_0_68 ).
cnf(c_0_663,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
i_0_69 ).
cnf(c_0_664,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
i_0_215 ).
cnf(c_0_665,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ is_antisymmetric_in(X1,relation_field(X1)) ),
i_0_47 ).
cnf(c_0_666,plain,
( is_antisymmetric_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
i_0_214 ).
cnf(c_0_667,plain,
( connected(X1)
| ~ relation(X1)
| ~ is_connected_in(X1,relation_field(X1)) ),
i_0_67 ).
cnf(c_0_668,plain,
( is_connected_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
i_0_213 ).
cnf(c_0_669,lemma,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1)) ),
i_0_590 ).
cnf(c_0_670,plain,
( is_well_founded_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
i_0_212 ).
cnf(c_0_671,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
i_0_259 ).
cnf(c_0_672,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ well_orders(X1,X2) ),
i_0_216 ).
cnf(c_0_673,plain,
( well_orders(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ connected(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_661,c_0_662]) ).
cnf(c_0_674,plain,
( is_antisymmetric_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
i_0_48 ).
cnf(c_0_675,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_663,c_0_664]) ).
cnf(c_0_676,negated_conjecture,
( well_ordering(esk120_0)
| well_orders(esk120_0,relation_field(esk120_0)) ),
i_0_631 ).
cnf(c_0_677,negated_conjecture,
relation(esk120_0),
i_0_633 ).
cnf(c_0_678,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_665,c_0_666]) ).
cnf(c_0_679,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_667,c_0_668]) ).
cnf(c_0_680,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_669,c_0_670]) ).
cnf(c_0_681,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_orders(X1,relation_field(X1)) ),
inference(spm,[status(thm)],[c_0_671,c_0_672]) ).
cnf(c_0_682,plain,
( well_orders(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ is_transitive_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_673,c_0_674]) ).
cnf(c_0_683,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ transitive(X1) ),
i_0_70 ).
cnf(c_0_684,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ well_founded_relation(X1)
| ~ reflexive(X1) ),
i_0_187 ).
cnf(c_0_685,negated_conjecture,
( transitive(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_675,c_0_676]),c_0_677])]) ).
cnf(c_0_686,negated_conjecture,
( antisymmetric(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_678,c_0_676]),c_0_677])]) ).
cnf(c_0_687,negated_conjecture,
( connected(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_679,c_0_676]),c_0_677])]) ).
cnf(c_0_688,negated_conjecture,
( well_founded_relation(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_680,c_0_676]),c_0_677])]) ).
cnf(c_0_689,negated_conjecture,
( reflexive(esk120_0)
| well_ordering(esk120_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_681,c_0_676]),c_0_677])]) ).
cnf(c_0_690,plain,
( well_orders(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_682,c_0_683]) ).
cnf(c_0_691,lemma,
( is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
i_0_591 ).
cnf(c_0_692,negated_conjecture,
( ~ well_ordering(esk120_0)
| ~ well_orders(esk120_0,relation_field(esk120_0)) ),
i_0_632 ).
cnf(c_0_693,plain,
well_ordering(esk120_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_684,c_0_685]),c_0_677])]),c_0_686]),c_0_687]),c_0_688]),c_0_689]) ).
cnf(c_0_694,lemma,
( well_orders(X1,relation_field(X1))
| ~ reflexive(X1)
| ~ well_founded_relation(X1)
| ~ transitive(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_690,c_0_691]) ).
cnf(c_0_695,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_192 ).
cnf(c_0_696,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_190 ).
cnf(c_0_697,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_189 ).
cnf(c_0_698,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_191 ).
cnf(c_0_699,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_188 ).
cnf(c_0_700,negated_conjecture,
~ well_orders(esk120_0,relation_field(esk120_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_692,c_0_693])]) ).
cnf(c_0_701,plain,
( well_orders(X1,relation_field(X1))
| ~ relation(X1)
| ~ well_ordering(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_694,c_0_695]),c_0_696]),c_0_697]),c_0_698]),c_0_699]) ).
cnf(c_0_702,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_700,c_0_701]),c_0_677]),c_0_693])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU244+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 01:46:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 9.47/2.73 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.47/2.73 # No SInE strategy applied
% 9.47/2.73 # Trying AutoSched0 for 150 seconds
% 9.47/2.73 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_RG_S04BN
% 9.47/2.73 # and selection function PSelectComplexExceptUniqMaxHorn.
% 9.47/2.73 #
% 9.47/2.73 # Preprocessing time : 0.027 s
% 9.47/2.73
% 9.47/2.73 # Proof found!
% 9.47/2.73 # SZS status Theorem
% 9.47/2.73 # SZS output start CNFRefutation
% See solution above
% 9.47/2.73 # Training examples: 0 positive, 0 negative
% 9.47/2.73
% 9.47/2.73 # -------------------------------------------------
% 9.47/2.73 # User time : 0.037 s
% 9.47/2.73 # System time : 0.004 s
% 9.47/2.73 # Total time : 0.041 s
% 9.47/2.73 # Maximum resident set size: 7120 pages
% 9.47/2.73
%------------------------------------------------------------------------------