TSTP Solution File: SEU257+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU257+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:09 EDT 2022
% Result : Theorem 16.49s 3.62s
% Output : CNFRefutation 16.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 42 ( 10 unt; 0 nHn; 29 RR)
% Number of literals : 140 ( 0 equ; 103 neg)
% Maximal clause size : 8 ( 3 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 : 48 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
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-u4f1a6tg/input.p',i_0_185) ).
cnf(i_0_485,lemma,
( reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ reflexive(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_485) ).
cnf(i_0_490,lemma,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_490) ).
cnf(i_0_493,lemma,
( antisymmetric(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_493) ).
cnf(i_0_505,lemma,
( well_founded_relation(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_505) ).
cnf(i_0_488,lemma,
( connected(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_488) ).
cnf(i_0_263,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_263) ).
cnf(i_0_187,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_187) ).
cnf(i_0_510,negated_conjecture,
well_ordering(esk108_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_510) ).
cnf(i_0_511,negated_conjecture,
relation(esk108_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_511) ).
cnf(i_0_186,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_186) ).
cnf(i_0_509,negated_conjecture,
~ well_ordering(relation_restriction(esk108_0,esk107_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_509) ).
cnf(i_0_190,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_190) ).
cnf(i_0_189,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_189) ).
cnf(i_0_188,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u4f1a6tg/input.p',i_0_188) ).
cnf(c_0_527,plain,
( well_ordering(X1)
| ~ relation(X1)
| ~ antisymmetric(X1)
| ~ connected(X1)
| ~ transitive(X1)
| ~ well_founded_relation(X1)
| ~ reflexive(X1) ),
i_0_185 ).
cnf(c_0_528,lemma,
( reflexive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ reflexive(X1) ),
i_0_485 ).
cnf(c_0_529,lemma,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(relation_restriction(X1,X2))
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ well_founded_relation(relation_restriction(X1,X2))
| ~ relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_527,c_0_528]) ).
cnf(c_0_530,lemma,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ transitive(X1) ),
i_0_490 ).
cnf(c_0_531,lemma,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(relation_restriction(X1,X2))
| ~ well_founded_relation(relation_restriction(X1,X2))
| ~ relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_529,c_0_530]) ).
cnf(c_0_532,lemma,
( antisymmetric(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ antisymmetric(X1) ),
i_0_493 ).
cnf(c_0_533,lemma,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ well_founded_relation(relation_restriction(X1,X2))
| ~ relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_531,c_0_532]) ).
cnf(c_0_534,lemma,
( well_founded_relation(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ well_founded_relation(X1) ),
i_0_505 ).
cnf(c_0_535,lemma,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(relation_restriction(X1,X2))
| ~ antisymmetric(X1)
| ~ well_founded_relation(X1)
| ~ relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_533,c_0_534]) ).
cnf(c_0_536,lemma,
( connected(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ connected(X1) ),
i_0_488 ).
cnf(c_0_537,lemma,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ well_founded_relation(X1)
| ~ relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_535,c_0_536]) ).
cnf(c_0_538,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
i_0_263 ).
cnf(c_0_539,plain,
( connected(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_187 ).
cnf(c_0_540,negated_conjecture,
well_ordering(esk108_0),
i_0_510 ).
cnf(c_0_541,negated_conjecture,
relation(esk108_0),
i_0_511 ).
cnf(c_0_542,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_186 ).
cnf(c_0_543,negated_conjecture,
~ well_ordering(relation_restriction(esk108_0,esk107_0)),
i_0_509 ).
cnf(c_0_544,plain,
( well_ordering(relation_restriction(X1,X2))
| ~ reflexive(X1)
| ~ transitive(X1)
| ~ connected(X1)
| ~ antisymmetric(X1)
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_537,c_0_538]) ).
cnf(c_0_545,negated_conjecture,
connected(esk108_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_539,c_0_540]),c_0_541])]) ).
cnf(c_0_546,negated_conjecture,
well_founded_relation(esk108_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_542,c_0_540]),c_0_541])]) ).
cnf(c_0_547,negated_conjecture,
( ~ reflexive(esk108_0)
| ~ transitive(esk108_0)
| ~ antisymmetric(esk108_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_543,c_0_544]),c_0_545]),c_0_546]),c_0_541])]) ).
cnf(c_0_548,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_190 ).
cnf(c_0_549,plain,
( ~ transitive(esk108_0)
| ~ antisymmetric(esk108_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_547,c_0_548]),c_0_540]),c_0_541])]) ).
cnf(c_0_550,plain,
( transitive(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_189 ).
cnf(c_0_551,plain,
~ antisymmetric(esk108_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_549,c_0_550]),c_0_540]),c_0_541])]) ).
cnf(c_0_552,plain,
( antisymmetric(X1)
| ~ relation(X1)
| ~ well_ordering(X1) ),
i_0_188 ).
cnf(c_0_553,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_551,c_0_552]),c_0_540]),c_0_541])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU257+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n009.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 18:48:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.49/3.62 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l6400-e0.15+coop-eprover66:
% 16.49/3.62 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 29; version: 991; iters: 150)
% 16.49/3.62 # Preprocessing time : 0.877 s
% 16.49/3.62 # Presaturation interreduction done
% 16.49/3.62
% 16.49/3.62 # Proof found!
% 16.49/3.62 # SZS status Theorem
% 16.49/3.62 # SZS output start CNFRefutation
% See solution above
% 16.49/3.62 # Training examples: 0 positive, 0 negative
% 16.49/3.62
% 16.49/3.62 # -------------------------------------------------
% 16.49/3.62 # User time : 0.888 s
% 16.49/3.62 # System time : 0.104 s
% 16.49/3.62 # Total time : 0.992 s
% 16.49/3.62 # ...preprocessing : 0.877 s
% 16.49/3.62 # ...main loop : 0.115 s
% 16.49/3.62 # Maximum resident set size: 168240 pages
% 16.49/3.62
%------------------------------------------------------------------------------