TSTP Solution File: GEO526+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO526+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:07 EDT 2022
% Result : Theorem 7.94s 2.39s
% Output : CNFRefutation 7.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 21 unt; 0 nHn; 31 RR)
% Number of literals : 56 ( 8 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_200,plain,
s_m(X1,midpoint(X1,X2),X2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_200) ).
cnf(i_0_38,negated_conjecture,
midpoint(esk3_0,esk5_0) = esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_38) ).
cnf(i_0_165,plain,
( X1 = s(X2,X3)
| ~ s_m(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_165) ).
cnf(i_0_166,plain,
s(X1,s(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_166) ).
cnf(i_0_207,plain,
( s_r(X1,X2,s(X2,X3))
| ~ s_r(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_207) ).
cnf(i_0_277,plain,
( s_e(X1,X2,X1,s(X3,X2))
| ~ s_r(X1,X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_277) ).
cnf(i_0_42,negated_conjecture,
s_r(esk4_0,esk2_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_42) ).
cnf(i_0_36,plain,
( s_e(X1,X2,X3,X2)
| ~ s_r(X3,X4,X2)
| ~ s_r(X1,X4,X2)
| ~ s_e(X1,X4,X3,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_36) ).
cnf(i_0_41,negated_conjecture,
s_e(esk1_0,esk2_0,esk4_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_41) ).
cnf(i_0_61,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X5,X6,X3,X4)
| ~ s_e(X1,X2,X5,X6) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_61) ).
cnf(i_0_43,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_43) ).
cnf(i_0_39,negated_conjecture,
~ s_e(esk1_0,esk3_0,esk4_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m2q0dl76/lgb.p',i_0_39) ).
cnf(c_0_290,plain,
s_m(X1,midpoint(X1,X2),X2),
i_0_200 ).
cnf(c_0_291,negated_conjecture,
midpoint(esk3_0,esk5_0) = esk2_0,
i_0_38 ).
cnf(c_0_292,plain,
( X1 = s(X2,X3)
| ~ s_m(X3,X2,X1) ),
i_0_165 ).
cnf(c_0_293,negated_conjecture,
s_m(esk3_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_290,c_0_291]) ).
cnf(c_0_294,plain,
s(X1,s(X1,X2)) = X2,
i_0_166 ).
cnf(c_0_295,plain,
s(esk2_0,esk3_0) = esk5_0,
inference(spm,[status(thm)],[c_0_292,c_0_293]) ).
cnf(c_0_296,plain,
( s_r(X1,X2,s(X2,X3))
| ~ s_r(X1,X2,X3) ),
i_0_207 ).
cnf(c_0_297,plain,
s(esk2_0,esk5_0) = esk3_0,
inference(spm,[status(thm)],[c_0_294,c_0_295]) ).
cnf(c_0_298,plain,
( s_e(X1,X2,X1,s(X3,X2))
| ~ s_r(X1,X3,X2) ),
i_0_277 ).
cnf(c_0_299,plain,
( s_r(X1,esk2_0,esk3_0)
| ~ s_r(X1,esk2_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_296,c_0_297]) ).
cnf(c_0_300,negated_conjecture,
s_r(esk4_0,esk2_0,esk5_0),
i_0_42 ).
cnf(c_0_301,plain,
( s_e(X1,esk3_0,X1,esk5_0)
| ~ s_r(X1,esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_298,c_0_295]) ).
cnf(c_0_302,negated_conjecture,
s_r(esk4_0,esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_299,c_0_300]) ).
cnf(c_0_303,plain,
( s_e(X1,X2,X3,X2)
| ~ s_r(X3,X4,X2)
| ~ s_r(X1,X4,X2)
| ~ s_e(X1,X4,X3,X4) ),
i_0_36 ).
cnf(c_0_304,negated_conjecture,
s_e(esk1_0,esk2_0,esk4_0,esk2_0),
i_0_41 ).
cnf(c_0_305,plain,
( s_e(X1,X2,X3,X4)
| ~ s_e(X5,X6,X3,X4)
| ~ s_e(X1,X2,X5,X6) ),
i_0_61 ).
cnf(c_0_306,plain,
s_e(esk4_0,esk3_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_301,c_0_302]) ).
cnf(c_0_307,negated_conjecture,
( s_e(esk1_0,X1,esk4_0,X1)
| ~ s_r(esk4_0,esk2_0,X1)
| ~ s_r(esk1_0,esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_303,c_0_304]) ).
cnf(c_0_308,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
i_0_43 ).
cnf(c_0_309,negated_conjecture,
~ s_e(esk1_0,esk3_0,esk4_0,esk5_0),
i_0_39 ).
cnf(c_0_310,plain,
( s_e(X1,X2,esk4_0,esk5_0)
| ~ s_e(X1,X2,esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_305,c_0_306]) ).
cnf(c_0_311,negated_conjecture,
s_e(esk1_0,esk3_0,esk4_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_307,c_0_302]),c_0_308])]) ).
cnf(c_0_312,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_309,c_0_310]),c_0_311])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO526+1 : TPTP v8.1.0. Released v7.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n004.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 : Sat Jun 18 09:43:10 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.94/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.94/2.39 # No SInE strategy applied
% 7.94/2.39 # Trying AutoSched0 for 150 seconds
% 7.94/2.39 # AutoSched0-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_RG_S04BN
% 7.94/2.39 # and selection function PSelectComplexExceptUniqMaxHorn.
% 7.94/2.39 #
% 7.94/2.39 # Preprocessing time : 0.026 s
% 7.94/2.39
% 7.94/2.39 # Proof found!
% 7.94/2.39 # SZS status Theorem
% 7.94/2.39 # SZS output start CNFRefutation
% See solution above
% 7.94/2.39 # Training examples: 0 positive, 0 negative
% 7.94/2.39
% 7.94/2.39 # -------------------------------------------------
% 7.94/2.39 # User time : 0.052 s
% 7.94/2.39 # System time : 0.007 s
% 7.94/2.39 # Total time : 0.059 s
% 7.94/2.39 # Maximum resident set size: 7128 pages
% 7.94/2.39
%------------------------------------------------------------------------------