TSTP Solution File: SEU292+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU292+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:29 EDT 2022
% Result : Theorem 11.54s 3.20s
% Output : CNFRefutation 11.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 35 ( 20 unt; 2 nHn; 35 RR)
% Number of literals : 62 ( 15 equ; 31 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 39 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_81,plain,
( X1 = empty_set
| relation_dom_as_subset(X2,X1,X3) = X2
| ~ relation_of2_as_subset(X3,X2,X1)
| ~ quasi_total(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_81) ).
cnf(i_0_1219,negated_conjecture,
relation_of2_as_subset(esk232_0,esk229_0,esk230_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1219) ).
cnf(i_0_1220,negated_conjecture,
quasi_total(esk232_0,esk229_0,esk230_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1220) ).
cnf(i_0_1215,negated_conjecture,
esk230_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1215) ).
cnf(i_0_476,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_476) ).
cnf(i_0_1214,negated_conjecture,
apply(relation_composition(esk232_0,esk233_0),esk231_0) != apply(esk233_0,apply(esk232_0,esk231_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1214) ).
cnf(i_0_1230,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1230) ).
cnf(i_0_1218,negated_conjecture,
relation(esk233_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1218) ).
cnf(i_0_1217,negated_conjecture,
function(esk233_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1217) ).
cnf(i_0_1221,negated_conjecture,
function(esk232_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1221) ).
cnf(i_0_482,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_482) ).
cnf(i_0_7,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_7) ).
cnf(i_0_320,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_320) ).
cnf(i_0_1216,negated_conjecture,
in(esk231_0,esk229_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wr0yrqsc/lgb.p',i_0_1216) ).
cnf(c_0_1245,plain,
( X1 = empty_set
| relation_dom_as_subset(X2,X1,X3) = X2
| ~ relation_of2_as_subset(X3,X2,X1)
| ~ quasi_total(X3,X2,X1) ),
i_0_81 ).
cnf(c_0_1246,negated_conjecture,
relation_of2_as_subset(esk232_0,esk229_0,esk230_0),
i_0_1219 ).
cnf(c_0_1247,negated_conjecture,
quasi_total(esk232_0,esk229_0,esk230_0),
i_0_1220 ).
cnf(c_0_1248,negated_conjecture,
esk230_0 != empty_set,
i_0_1215 ).
cnf(c_0_1249,plain,
( relation_dom_as_subset(X1,X2,X3) = relation_dom(X3)
| ~ relation_of2(X3,X1,X2) ),
i_0_476 ).
cnf(c_0_1250,negated_conjecture,
relation_dom_as_subset(esk229_0,esk230_0,esk232_0) = esk229_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1245,c_0_1246]),c_0_1247])]),c_0_1248]) ).
cnf(c_0_1251,negated_conjecture,
apply(relation_composition(esk232_0,esk233_0),esk231_0) != apply(esk233_0,apply(esk232_0,esk231_0)),
i_0_1214 ).
cnf(c_0_1252,lemma,
( apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3))
| ~ function(X2)
| ~ function(X1)
| ~ relation(X2)
| ~ relation(X1)
| ~ in(X3,relation_dom(X1)) ),
i_0_1230 ).
cnf(c_0_1253,negated_conjecture,
relation(esk233_0),
i_0_1218 ).
cnf(c_0_1254,negated_conjecture,
function(esk233_0),
i_0_1217 ).
cnf(c_0_1255,negated_conjecture,
function(esk232_0),
i_0_1221 ).
cnf(c_0_1256,plain,
( relation_dom(esk232_0) = esk229_0
| ~ relation_of2(esk232_0,esk229_0,esk230_0) ),
inference(spm,[status(thm)],[c_0_1249,c_0_1250]) ).
cnf(c_0_1257,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_482 ).
cnf(c_0_1258,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
i_0_7 ).
cnf(c_0_1259,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_320 ).
cnf(c_0_1260,negated_conjecture,
( ~ relation(esk232_0)
| ~ in(esk231_0,relation_dom(esk232_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1251,c_0_1252]),c_0_1253]),c_0_1254]),c_0_1255])]) ).
cnf(c_0_1261,plain,
relation_dom(esk232_0) = esk229_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1256,c_0_1257]),c_0_1246])]) ).
cnf(c_0_1262,negated_conjecture,
in(esk231_0,esk229_0),
i_0_1216 ).
cnf(c_0_1263,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_1258,c_0_1259]) ).
cnf(c_0_1264,negated_conjecture,
~ relation(esk232_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1260,c_0_1261]),c_0_1262])]) ).
cnf(c_0_1265,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1263,c_0_1246]),c_0_1264]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU292+2 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Sun Jun 19 02:57:50 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected SinE mode:
% 0.17/0.44 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.17/0.44 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.17/0.44 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 11.54/3.20 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.54/3.20 # No SInE strategy applied
% 11.54/3.20 # Trying AutoSched0 for 150 seconds
% 11.54/3.20 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 11.54/3.20 # and selection function SelectComplexExceptUniqMaxHorn.
% 11.54/3.20 #
% 11.54/3.20 # Preprocessing time : 0.024 s
% 11.54/3.20 # Presaturation interreduction done
% 11.54/3.20
% 11.54/3.20 # Proof found!
% 11.54/3.20 # SZS status Theorem
% 11.54/3.20 # SZS output start CNFRefutation
% See solution above
% 11.54/3.20 # Training examples: 0 positive, 0 negative
% 11.54/3.20
% 11.54/3.20 # -------------------------------------------------
% 11.54/3.20 # User time : 0.037 s
% 11.54/3.20 # System time : 0.005 s
% 11.54/3.20 # Total time : 0.042 s
% 11.54/3.20 # Maximum resident set size: 7124 pages
% 11.54/3.20
%------------------------------------------------------------------------------