TSTP Solution File: GEO298+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO298+1 : TPTP v8.1.0. Released v4.1.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 : Sat Jul 16 03:45:11 EDT 2022
% Result : Theorem 8.64s 2.54s
% Output : CNFRefutation 8.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of clauses : 57 ( 46 unt; 5 nHn; 57 RR)
% Number of literals : 143 ( 45 equ; 84 neg)
% Maximal clause size : 17 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
esk9_0 = vd1199,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_48) ).
cnf(i_0_66,plain,
vd1185 = vd1199,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_66) ).
cnf(i_0_163,plain,
( rR(X1,X2,X3)
| X3 != X4
| X2 != X5
| X1 != X6
| ~ rpoint(X4)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rR(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_163) ).
cnf(i_0_47,plain,
rpoint(esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_47) ).
cnf(i_0_10,plain,
rpoint(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_10) ).
cnf(i_0_11,plain,
vd1201 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_11) ).
cnf(i_0_26,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_26) ).
cnf(i_0_27,plain,
vd1187 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_27) ).
cnf(i_0_6,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rR(X2,X1,X3)
| rR(X1,X2,X3)
| rR(X3,X2,X1)
| X2 != X4
| X1 != X5
| X3 != X6
| X7 != X8
| ~ rline(X8)
| ~ rpoint(X4)
| ~ rpoint(X5)
| ~ rpoint(X6)
| ~ ron(X2,X7)
| ~ ron(X1,X7)
| ~ ron(X3,X7) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
~ rR(vd1185,vd1201,vd1187),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_5) ).
cnf(i_0_87,plain,
( X1 != X2
| X3 != X4
| X5 != X6
| ~ rline(X2)
| ~ rpoint(X6)
| ~ rpoint(X4)
| ~ ron(X5,X1)
| ~ rS(X5,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_87) ).
cnf(i_0_2,negated_conjecture,
~ rR(vd1201,vd1185,vd1187),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_2) ).
cnf(i_0_3,plain,
vd1187 != vd1201,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
~ rR(vd1187,vd1185,vd1201),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_1) ).
cnf(i_0_7,plain,
rS(vd1201,vd1187,vd1197),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_7) ).
cnf(i_0_12,plain,
rline(vd1197),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_12) ).
cnf(i_0_51,plain,
ron(vd1201,vd1232),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_51) ).
cnf(i_0_63,plain,
ron(vd1185,vd1232),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_63) ).
cnf(i_0_8,plain,
ron(vd1187,vd1232),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_8) ).
cnf(i_0_64,plain,
rline(vd1232),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_64) ).
cnf(i_0_9,plain,
ron(vd1185,vd1197),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_9) ).
cnf(i_0_81,plain,
~ ron(vd1187,vd1197),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p4yllmwj/lgb.p',i_0_81) ).
cnf(c_0_186,plain,
esk9_0 = vd1199,
i_0_48 ).
cnf(c_0_187,plain,
vd1185 = vd1199,
i_0_66 ).
cnf(c_0_188,plain,
( rR(X1,X2,X3)
| X3 != X4
| X2 != X5
| X1 != X6
| ~ rpoint(X4)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rR(X1,X3,X2) ),
i_0_163 ).
cnf(c_0_189,plain,
rpoint(esk9_0),
i_0_47 ).
cnf(c_0_190,plain,
esk9_0 = vd1185,
inference(rw,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_191,plain,
rpoint(esk1_0),
i_0_10 ).
cnf(c_0_192,plain,
vd1201 = esk1_0,
i_0_11 ).
cnf(c_0_193,plain,
rpoint(esk2_0),
i_0_26 ).
cnf(c_0_194,plain,
vd1187 = esk2_0,
i_0_27 ).
cnf(c_0_195,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rR(X2,X1,X3)
| rR(X1,X2,X3)
| rR(X3,X2,X1)
| X2 != X4
| X1 != X5
| X3 != X6
| X7 != X8
| ~ rline(X8)
| ~ rpoint(X4)
| ~ rpoint(X5)
| ~ rpoint(X6)
| ~ ron(X2,X7)
| ~ ron(X1,X7)
| ~ ron(X3,X7) ),
i_0_6 ).
cnf(c_0_196,plain,
~ rR(vd1185,vd1201,vd1187),
i_0_5 ).
cnf(c_0_197,plain,
( rR(X1,X2,X3)
| ~ rR(X1,X3,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_188])])]) ).
cnf(c_0_198,plain,
rpoint(vd1185),
inference(rw,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_199,plain,
rpoint(vd1201),
inference(rw,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_200,plain,
rpoint(vd1187),
inference(rw,[status(thm)],[c_0_193,c_0_194]) ).
cnf(c_0_201,plain,
( X1 != X2
| X3 != X4
| X5 != X6
| ~ rline(X2)
| ~ rpoint(X6)
| ~ rpoint(X4)
| ~ ron(X5,X1)
| ~ rS(X5,X3,X1) ),
i_0_87 ).
cnf(c_0_202,negated_conjecture,
~ rR(vd1201,vd1185,vd1187),
i_0_2 ).
cnf(c_0_203,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rR(X2,X1,X3)
| rR(X1,X3,X2)
| rR(X3,X1,X2)
| ~ ron(X2,X4)
| ~ ron(X1,X4)
| ~ ron(X3,X4)
| ~ rline(X4)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_195])])])]) ).
cnf(c_0_204,plain,
vd1187 != vd1201,
i_0_3 ).
cnf(c_0_205,negated_conjecture,
~ rR(vd1187,vd1185,vd1201),
i_0_1 ).
cnf(c_0_206,plain,
~ rR(vd1185,vd1187,vd1201),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197]),c_0_198]),c_0_199]),c_0_200])]) ).
cnf(c_0_207,plain,
( ~ rS(X1,X2,X3)
| ~ ron(X1,X3)
| ~ rline(X3)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_201])])]) ).
cnf(c_0_208,plain,
rS(vd1201,vd1187,vd1197),
i_0_7 ).
cnf(c_0_209,plain,
rline(vd1197),
i_0_12 ).
cnf(c_0_210,negated_conjecture,
( vd1201 = vd1185
| vd1187 = vd1185
| ~ ron(vd1201,X1)
| ~ ron(vd1185,X1)
| ~ ron(vd1187,X1)
| ~ rline(X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_199]),c_0_200]),c_0_198])]),c_0_204]),c_0_205]),c_0_206]) ).
cnf(c_0_211,plain,
ron(vd1201,vd1232),
i_0_51 ).
cnf(c_0_212,plain,
ron(vd1185,vd1232),
i_0_63 ).
cnf(c_0_213,plain,
ron(vd1187,vd1232),
i_0_8 ).
cnf(c_0_214,plain,
rline(vd1232),
i_0_64 ).
cnf(c_0_215,plain,
~ ron(vd1201,vd1197),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_209]),c_0_199]),c_0_200])]) ).
cnf(c_0_216,plain,
( vd1187 = vd1185
| vd1201 = vd1185 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_211]),c_0_212]),c_0_213]),c_0_214])]) ).
cnf(c_0_217,plain,
ron(vd1185,vd1197),
i_0_9 ).
cnf(c_0_218,plain,
~ ron(vd1187,vd1197),
i_0_81 ).
cnf(c_0_219,plain,
vd1187 = vd1185,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_217])]) ).
cnf(c_0_220,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_219]),c_0_217])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GEO298+1 : TPTP v8.1.0. Released v4.1.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 22:45:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.64/2.54 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.64/2.54 # No SInE strategy applied
% 8.64/2.54 # Trying AutoSched0 for 150 seconds
% 8.64/2.54 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S080N
% 8.64/2.54 # and selection function SelectCQIArNXTEqFirst.
% 8.64/2.54 #
% 8.64/2.54 # Preprocessing time : 0.025 s
% 8.64/2.54 # Presaturation interreduction done
% 8.64/2.54
% 8.64/2.54 # Proof found!
% 8.64/2.54 # SZS status Theorem
% 8.64/2.54 # SZS output start CNFRefutation
% See solution above
% 8.64/2.54 # Training examples: 0 positive, 0 negative
% 8.64/2.54
% 8.64/2.54 # -------------------------------------------------
% 8.64/2.54 # User time : 0.060 s
% 8.64/2.54 # System time : 0.010 s
% 8.64/2.54 # Total time : 0.070 s
% 8.64/2.54 # Maximum resident set size: 7124 pages
% 8.64/2.54
%------------------------------------------------------------------------------