TSTP Solution File: SEU261+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU261+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:11 EDT 2022
% Result : Theorem 7.60s 2.53s
% Output : CNFRefutation 7.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 54 ( 18 unt; 0 nHn; 54 RR)
% Number of literals : 137 ( 0 equ; 94 neg)
% Maximal clause size : 7 ( 2 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 : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_580,lemma,
( epred1_2(X1,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2)
| ~ relation_isomorphism(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_580) ).
cnf(i_0_597,negated_conjecture,
relation_isomorphism(esk118_0,esk119_0,esk120_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_597) ).
cnf(i_0_600,negated_conjecture,
relation(esk120_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_600) ).
cnf(i_0_602,negated_conjecture,
relation(esk118_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_602) ).
cnf(i_0_601,negated_conjecture,
relation(esk119_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_601) ).
cnf(i_0_599,negated_conjecture,
function(esk120_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_599) ).
cnf(i_0_665,plain,
( well_founded_relation(X1)
| ~ well_founded_relation(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_665) ).
cnf(i_0_185,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ well_founded_relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_185) ).
cnf(i_0_596,negated_conjecture,
~ well_ordering(esk119_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_596) ).
cnf(i_0_186,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_186) ).
cnf(i_0_598,negated_conjecture,
well_ordering(esk118_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_598) ).
cnf(i_0_666,plain,
( antisymmetric(X1)
| ~ antisymmetric(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_666) ).
cnf(i_0_188,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_188) ).
cnf(i_0_667,plain,
( connected(X1)
| ~ connected(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_667) ).
cnf(i_0_187,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_187) ).
cnf(i_0_668,plain,
( transitive(X1)
| ~ transitive(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_668) ).
cnf(i_0_189,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_189) ).
cnf(i_0_669,plain,
( reflexive(X1)
| ~ reflexive(X2)
| ~ epred1_2(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_669) ).
cnf(i_0_190,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrilzzwg/lgb.p',i_0_190) ).
cnf(c_0_689,lemma,
( epred1_2(X1,X2)
| ~ function(X3)
| ~ relation(X3)
| ~ relation(X1)
| ~ relation(X2)
| ~ relation_isomorphism(X2,X1,X3) ),
i_0_580 ).
cnf(c_0_690,negated_conjecture,
relation_isomorphism(esk118_0,esk119_0,esk120_0),
i_0_597 ).
cnf(c_0_691,negated_conjecture,
relation(esk120_0),
i_0_600 ).
cnf(c_0_692,negated_conjecture,
relation(esk118_0),
i_0_602 ).
cnf(c_0_693,negated_conjecture,
relation(esk119_0),
i_0_601 ).
cnf(c_0_694,negated_conjecture,
function(esk120_0),
i_0_599 ).
cnf(c_0_695,plain,
( well_founded_relation(X1)
| ~ well_founded_relation(X2)
| ~ epred1_2(X1,X2) ),
i_0_665 ).
cnf(c_0_696,negated_conjecture,
epred1_2(esk119_0,esk118_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_689,c_0_690]),c_0_691]),c_0_692]),c_0_693]),c_0_694])]) ).
cnf(c_0_697,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ well_founded_relation(X1)
| ~ reflexive(X1) ),
i_0_185 ).
cnf(c_0_698,plain,
( well_founded_relation(esk119_0)
| ~ well_founded_relation(esk118_0) ),
inference(spm,[status(thm)],[c_0_695,c_0_696]) ).
cnf(c_0_699,negated_conjecture,
~ well_ordering(esk119_0),
i_0_596 ).
cnf(c_0_700,plain,
( ~ well_founded_relation(esk118_0)
| ~ antisymmetric(esk119_0)
| ~ connected(esk119_0)
| ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_697,c_0_698]),c_0_693])]),c_0_699]) ).
cnf(c_0_701,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_186 ).
cnf(c_0_702,negated_conjecture,
well_ordering(esk118_0),
i_0_598 ).
cnf(c_0_703,plain,
( antisymmetric(X1)
| ~ antisymmetric(X2)
| ~ epred1_2(X1,X2) ),
i_0_666 ).
cnf(c_0_704,plain,
( ~ antisymmetric(esk119_0)
| ~ connected(esk119_0)
| ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_700,c_0_701]),c_0_702]),c_0_692])]) ).
cnf(c_0_705,plain,
( antisymmetric(esk119_0)
| ~ antisymmetric(esk118_0) ),
inference(spm,[status(thm)],[c_0_703,c_0_696]) ).
cnf(c_0_706,plain,
( ~ antisymmetric(esk118_0)
| ~ connected(esk119_0)
| ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(spm,[status(thm)],[c_0_704,c_0_705]) ).
cnf(c_0_707,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_188 ).
cnf(c_0_708,plain,
( connected(X1)
| ~ connected(X2)
| ~ epred1_2(X1,X2) ),
i_0_667 ).
cnf(c_0_709,plain,
( ~ connected(esk119_0)
| ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_706,c_0_707]),c_0_702]),c_0_692])]) ).
cnf(c_0_710,plain,
( connected(esk119_0)
| ~ connected(esk118_0) ),
inference(spm,[status(thm)],[c_0_708,c_0_696]) ).
cnf(c_0_711,plain,
( ~ connected(esk118_0)
| ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(spm,[status(thm)],[c_0_709,c_0_710]) ).
cnf(c_0_712,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_187 ).
cnf(c_0_713,plain,
( transitive(X1)
| ~ transitive(X2)
| ~ epred1_2(X1,X2) ),
i_0_668 ).
cnf(c_0_714,plain,
( ~ transitive(esk119_0)
| ~ reflexive(esk119_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_711,c_0_712]),c_0_702]),c_0_692])]) ).
cnf(c_0_715,plain,
( transitive(esk119_0)
| ~ transitive(esk118_0) ),
inference(spm,[status(thm)],[c_0_713,c_0_696]) ).
cnf(c_0_716,plain,
( ~ transitive(esk118_0)
| ~ reflexive(esk119_0) ),
inference(spm,[status(thm)],[c_0_714,c_0_715]) ).
cnf(c_0_717,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_189 ).
cnf(c_0_718,plain,
( reflexive(X1)
| ~ reflexive(X2)
| ~ epred1_2(X1,X2) ),
i_0_669 ).
cnf(c_0_719,plain,
~ reflexive(esk119_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_716,c_0_717]),c_0_702]),c_0_692])]) ).
cnf(c_0_720,plain,
( reflexive(esk119_0)
| ~ reflexive(esk118_0) ),
inference(spm,[status(thm)],[c_0_718,c_0_696]) ).
cnf(c_0_721,plain,
~ reflexive(esk118_0),
inference(spm,[status(thm)],[c_0_719,c_0_720]) ).
cnf(c_0_722,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_190 ).
cnf(c_0_723,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_721,c_0_722]),c_0_702]),c_0_692])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU261+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n025.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 14:10:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.47 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.60/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.53 # No SInE strategy applied
% 7.60/2.53 # Trying AutoSched0 for 150 seconds
% 7.60/2.53 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.60/2.53 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.60/2.53 #
% 7.60/2.53 # Preprocessing time : 0.025 s
% 7.60/2.53
% 7.60/2.53 # Proof found!
% 7.60/2.53 # SZS status Theorem
% 7.60/2.53 # SZS output start CNFRefutation
% See solution above
% 7.60/2.53 # Training examples: 0 positive, 0 negative
% 7.60/2.53
% 7.60/2.53 # -------------------------------------------------
% 7.60/2.53 # User time : 0.034 s
% 7.60/2.53 # System time : 0.007 s
% 7.60/2.53 # Total time : 0.041 s
% 7.60/2.53 # Maximum resident set size: 7128 pages
% 7.60/2.53
%------------------------------------------------------------------------------