TSTP Solution File: GEO305+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO305+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:13 EDT 2022
% Result : Theorem 8.39s 2.58s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 30 ( 26 unt; 0 nHn; 30 RR)
% Number of literals : 62 ( 14 equ; 34 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,plain,
( ron(X1,X2)
| X1 != X3
| X4 != X5
| X6 != X7
| X2 != X8
| ~ rpoint(X5)
| ~ rpoint(X7)
| ~ rpoint(X3)
| ~ rline(X8)
| ~ ron(X4,X2)
| ~ ron(X6,X2)
| ~ rR(X6,X4,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_25) ).
cnf(i_0_19,plain,
rpoint(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_19) ).
cnf(i_0_20,plain,
vd1289 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_20) ).
cnf(i_0_15,plain,
rpoint(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_15) ).
cnf(i_0_16,plain,
vd1287 = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_16) ).
cnf(i_0_5,plain,
rpoint(vd1303),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_5) ).
cnf(i_0_7,plain,
vd1302 = vd1303,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
rR(vd1289,vd1287,vd1302),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_6) ).
cnf(i_0_9,plain,
ron(vd1289,vd1297),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_9) ).
cnf(i_0_11,plain,
rline(vd1297),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_11) ).
cnf(i_0_10,plain,
ron(vd1287,vd1297),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_10) ).
cnf(i_0_1,negated_conjecture,
~ ron(vd1302,vd1297),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k70rxebj/lgb.p',i_0_1) ).
cnf(c_0_38,plain,
( ron(X1,X2)
| X1 != X3
| X4 != X5
| X6 != X7
| X2 != X8
| ~ rpoint(X5)
| ~ rpoint(X7)
| ~ rpoint(X3)
| ~ rline(X8)
| ~ ron(X4,X2)
| ~ ron(X6,X2)
| ~ rR(X6,X4,X1) ),
i_0_25 ).
cnf(c_0_39,plain,
rpoint(esk1_0),
i_0_19 ).
cnf(c_0_40,plain,
vd1289 = esk1_0,
i_0_20 ).
cnf(c_0_41,plain,
rpoint(esk3_0),
i_0_15 ).
cnf(c_0_42,plain,
vd1287 = esk3_0,
i_0_16 ).
cnf(c_0_43,plain,
rpoint(vd1303),
i_0_5 ).
cnf(c_0_44,plain,
vd1302 = vd1303,
i_0_7 ).
cnf(c_0_45,plain,
( ron(X1,X2)
| ~ rR(X3,X4,X1)
| ~ rline(X2)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rpoint(X1)
| ~ ron(X3,X2)
| ~ ron(X4,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_38])])])]) ).
cnf(c_0_46,plain,
rR(vd1289,vd1287,vd1302),
i_0_6 ).
cnf(c_0_47,plain,
rpoint(vd1289),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
rpoint(vd1287),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
rpoint(vd1302),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( ron(vd1302,X1)
| ~ rline(X1)
| ~ ron(vd1289,X1)
| ~ ron(vd1287,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_51,plain,
ron(vd1289,vd1297),
i_0_9 ).
cnf(c_0_52,plain,
rline(vd1297),
i_0_11 ).
cnf(c_0_53,plain,
ron(vd1287,vd1297),
i_0_10 ).
cnf(c_0_54,negated_conjecture,
~ ron(vd1302,vd1297),
i_0_1 ).
cnf(c_0_55,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_53])]),c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GEO305+1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n016.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 : Sat Jun 18 11:20:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.46 # ENIGMATIC: Selected complete mode:
% 8.39/2.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.39/2.58 # No SInE strategy applied
% 8.39/2.58 # Trying AutoSched0 for 150 seconds
% 8.39/2.58 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.39/2.58 # and selection function SelectCQArNTNpEqFirst.
% 8.39/2.58 #
% 8.39/2.58 # Preprocessing time : 0.025 s
% 8.39/2.58 # Presaturation interreduction done
% 8.39/2.58
% 8.39/2.58 # Proof found!
% 8.39/2.58 # SZS status Theorem
% 8.39/2.58 # SZS output start CNFRefutation
% See solution above
% 8.39/2.58 # Training examples: 0 positive, 0 negative
% 8.39/2.58
% 8.39/2.58 # -------------------------------------------------
% 8.39/2.58 # User time : 0.038 s
% 8.39/2.58 # System time : 0.011 s
% 8.39/2.58 # Total time : 0.048 s
% 8.39/2.58 # Maximum resident set size: 7124 pages
% 8.39/2.58
%------------------------------------------------------------------------------