TSTP Solution File: GEO511+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO511+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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 : Sat Jul 16 03:46:03 EDT 2022
% Result : Theorem 8.72s 2.62s
% Output : CNFRefutation 8.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of clauses : 43 ( 24 unt; 0 nHn; 35 RR)
% Number of literals : 109 ( 17 equ; 71 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-5 aty)
% Number of variables : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_113,plain,
( X1 = X2
| ~ s_m(X3,X2,X4)
| ~ s_m(X3,X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_113) ).
cnf(i_0_125,plain,
s_m(X1,X2,s(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_125) ).
cnf(i_0_128,plain,
s(X1,s(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_128) ).
cnf(i_0_127,plain,
( X1 = s(X2,X3)
| ~ s_m(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_127) ).
cnf(i_0_162,plain,
s_m(X1,midpoint(X1,X2),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_162) ).
cnf(i_0_164,plain,
( s_m(X1,X2,X3)
| X2 != ip(X4,X5,X6,X3,X7)
| ~ s_t(X3,X7,X6)
| ~ s_t(X4,X5,X6)
| ~ s_col(X1,X3,X5)
| ~ s_e(X1,X4,X3,X7)
| ~ perp(X6,X3,X1,X3)
| ~ perp(X4,X1,X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_164) ).
cnf(i_0_165,plain,
( s_m(X1,X2,X3)
| X2 != ip(X1,X4,X5,X6,X3)
| ~ s_t(X6,X3,X5)
| ~ s_t(X1,X4,X5)
| ~ s_col(X7,X6,X4)
| ~ s_e(X7,X1,X6,X3)
| ~ perp(X5,X6,X7,X6)
| ~ perp(X1,X7,X7,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_165) ).
cnf(i_0_167,negated_conjecture,
s_e(esk2_0,esk1_0,esk3_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_167) ).
cnf(i_0_172,negated_conjecture,
perp(esk1_0,esk2_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_172) ).
cnf(i_0_166,negated_conjecture,
~ s_m(esk1_0,midpoint(esk2_0,esk3_0),esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_166) ).
cnf(i_0_171,negated_conjecture,
perp(esk4_0,esk3_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_171) ).
cnf(i_0_168,negated_conjecture,
s_t(esk3_0,esk6_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_168) ).
cnf(i_0_169,negated_conjecture,
s_t(esk1_0,esk5_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_169) ).
cnf(i_0_170,negated_conjecture,
s_col(esk2_0,esk3_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-o0251n_a/lgb.p',i_0_170) ).
cnf(c_0_187,plain,
( X1 = X2
| ~ s_m(X3,X2,X4)
| ~ s_m(X3,X1,X4) ),
i_0_113 ).
cnf(c_0_188,plain,
s_m(X1,X2,s(X2,X1)),
i_0_125 ).
cnf(c_0_189,plain,
( X1 = X2
| ~ s_m(X3,X1,s(X2,X3)) ),
inference(spm,[status(thm)],[c_0_187,c_0_188]) ).
cnf(c_0_190,plain,
s(X1,s(X1,X2)) = X2,
i_0_128 ).
cnf(c_0_191,plain,
( X1 = s(X2,X3)
| ~ s_m(X3,X2,X1) ),
i_0_127 ).
cnf(c_0_192,plain,
s_m(X1,midpoint(X1,X2),X2),
i_0_162 ).
cnf(c_0_193,plain,
( s_m(X1,X2,X3)
| X2 != ip(X4,X5,X6,X3,X7)
| ~ s_t(X3,X7,X6)
| ~ s_t(X4,X5,X6)
| ~ s_col(X1,X3,X5)
| ~ s_e(X1,X4,X3,X7)
| ~ perp(X6,X3,X1,X3)
| ~ perp(X4,X1,X1,X3) ),
i_0_164 ).
cnf(c_0_194,plain,
( X1 = X2
| ~ s_m(s(X2,X3),X1,X3) ),
inference(spm,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_195,plain,
s(midpoint(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_196,plain,
( s_m(X1,X2,X3)
| X2 != ip(X1,X4,X5,X6,X3)
| ~ s_t(X6,X3,X5)
| ~ s_t(X1,X4,X5)
| ~ s_col(X7,X6,X4)
| ~ s_e(X7,X1,X6,X3)
| ~ perp(X5,X6,X7,X6)
| ~ perp(X1,X7,X7,X6) ),
i_0_165 ).
cnf(c_0_197,plain,
( s_m(X1,ip(X2,X3,X4,X5,X6),X5)
| ~ s_e(X1,X2,X5,X6)
| ~ s_t(X2,X3,X4)
| ~ s_t(X5,X6,X4)
| ~ s_col(X1,X5,X3)
| ~ perp(X4,X5,X1,X5)
| ~ perp(X2,X1,X1,X5) ),
inference(er,[status(thm)],[c_0_193]) ).
cnf(c_0_198,negated_conjecture,
s_e(esk2_0,esk1_0,esk3_0,esk6_0),
i_0_167 ).
cnf(c_0_199,negated_conjecture,
perp(esk1_0,esk2_0,esk2_0,esk3_0),
i_0_172 ).
cnf(c_0_200,plain,
( X1 = midpoint(X2,X3)
| ~ s_m(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_194,c_0_195]) ).
cnf(c_0_201,plain,
( s_m(X1,ip(X1,X2,X3,X4,X5),X5)
| ~ s_e(X6,X1,X4,X5)
| ~ s_t(X4,X5,X3)
| ~ s_t(X1,X2,X3)
| ~ s_col(X6,X4,X2)
| ~ perp(X3,X4,X6,X4)
| ~ perp(X1,X6,X6,X4) ),
inference(er,[status(thm)],[c_0_196]) ).
cnf(c_0_202,plain,
( X1 = midpoint(X2,X3)
| ~ s_m(X2,X1,X3) ),
inference(spm,[status(thm)],[c_0_187,c_0_192]) ).
cnf(c_0_203,negated_conjecture,
( s_m(esk2_0,ip(esk1_0,X1,X2,esk3_0,esk6_0),esk3_0)
| ~ s_t(esk3_0,esk6_0,X2)
| ~ s_t(esk1_0,X1,X2)
| ~ s_col(esk2_0,esk3_0,X1)
| ~ perp(X2,esk3_0,esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_197,c_0_198]),c_0_199])]) ).
cnf(c_0_204,plain,
midpoint(X1,X2) = midpoint(X2,X1),
inference(spm,[status(thm)],[c_0_200,c_0_192]) ).
cnf(c_0_205,negated_conjecture,
~ s_m(esk1_0,midpoint(esk2_0,esk3_0),esk6_0),
i_0_166 ).
cnf(c_0_206,negated_conjecture,
( s_m(esk1_0,ip(esk1_0,X1,X2,esk3_0,esk6_0),esk6_0)
| ~ s_t(esk3_0,esk6_0,X2)
| ~ s_t(esk1_0,X1,X2)
| ~ s_col(esk2_0,esk3_0,X1)
| ~ perp(X2,esk3_0,esk2_0,esk3_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_198]),c_0_199])]) ).
cnf(c_0_207,plain,
( ip(esk1_0,X1,X2,esk3_0,esk6_0) = midpoint(esk3_0,esk2_0)
| ~ s_t(esk3_0,esk6_0,X2)
| ~ s_t(esk1_0,X1,X2)
| ~ s_col(esk2_0,esk3_0,X1)
| ~ perp(X2,esk3_0,esk2_0,esk3_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_204]) ).
cnf(c_0_208,negated_conjecture,
~ s_m(esk1_0,midpoint(esk3_0,esk2_0),esk6_0),
inference(rw,[status(thm)],[c_0_205,c_0_204]) ).
cnf(c_0_209,negated_conjecture,
( ~ s_t(esk3_0,esk6_0,X1)
| ~ s_t(esk1_0,X2,X1)
| ~ s_col(esk2_0,esk3_0,X2)
| ~ perp(X1,esk3_0,esk2_0,esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_208]) ).
cnf(c_0_210,negated_conjecture,
perp(esk4_0,esk3_0,esk2_0,esk3_0),
i_0_171 ).
cnf(c_0_211,negated_conjecture,
s_t(esk3_0,esk6_0,esk4_0),
i_0_168 ).
cnf(c_0_212,negated_conjecture,
( ~ s_t(esk1_0,X1,esk4_0)
| ~ s_col(esk2_0,esk3_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_210]),c_0_211])]) ).
cnf(c_0_213,negated_conjecture,
s_t(esk1_0,esk5_0,esk4_0),
i_0_169 ).
cnf(c_0_214,negated_conjecture,
s_col(esk2_0,esk3_0,esk5_0),
i_0_170 ).
cnf(c_0_215,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO511+1 : TPTP v8.1.0. Released v7.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 18 14:44:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.72/2.62 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.72/2.62 # No SInE strategy applied
% 8.72/2.62 # Trying AutoSched0 for 150 seconds
% 8.72/2.62 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.72/2.62 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.72/2.62 #
% 8.72/2.62 # Preprocessing time : 0.024 s
% 8.72/2.62 # Presaturation interreduction done
% 8.72/2.62
% 8.72/2.62 # Proof found!
% 8.72/2.62 # SZS status Theorem
% 8.72/2.62 # SZS output start CNFRefutation
% See solution above
% 8.72/2.62 # Training examples: 0 positive, 0 negative
% 8.72/2.62
% 8.72/2.62 # -------------------------------------------------
% 8.72/2.62 # User time : 0.204 s
% 8.72/2.62 # System time : 0.010 s
% 8.72/2.62 # Total time : 0.215 s
% 8.72/2.62 # Maximum resident set size: 7128 pages
% 8.72/2.62
%------------------------------------------------------------------------------