TSTP Solution File: GEO284+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO284+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:07 EDT 2022
% Result : Theorem 8.03s 2.50s
% Output : CNFRefutation 8.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 25 unt; 19 nHn; 49 RR)
% Number of literals : 155 ( 60 equ; 96 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
vd1129 = vd1130,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_23) ).
cnf(i_0_2,plain,
vd1129 = vd1123,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_2) ).
cnf(i_0_43,plain,
( X1 = X2
| rcenter(X1,esk3_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_43) ).
cnf(i_0_22,plain,
rpoint(vd1130),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_22) ).
cnf(i_0_1,negated_conjecture,
( ~ rcircle(X1)
| ~ rline(X2)
| ~ ron(vd1127,X1)
| ~ ron(vd1123,X2)
| ~ ron(vd1125,X2)
| ~ rcenter(vd1123,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_1) ).
cnf(i_0_67,plain,
( X1 = X2
| ron(X1,esk5_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_67) ).
cnf(i_0_44,plain,
( X1 = X2
| ron(X1,esk3_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_44) ).
cnf(i_0_20,plain,
rpoint(vd1128),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_20) ).
cnf(i_0_21,plain,
vd1127 = vd1128,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_21) ).
cnf(i_0_25,plain,
vd1127 != vd1129,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_25) ).
cnf(i_0_66,plain,
( X1 = X2
| ron(X1,esk5_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_66) ).
cnf(i_0_18,plain,
rpoint(vd1126),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_18) ).
cnf(i_0_19,plain,
vd1125 = vd1126,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_19) ).
cnf(i_0_24,plain,
vd1125 != vd1123,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_24) ).
cnf(i_0_42,plain,
( X1 = X2
| rcircle(esk3_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_42) ).
cnf(i_0_65,plain,
( X1 = X2
| rline(esk5_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p69g4wup/lgb.p',i_0_65) ).
cnf(c_0_84,plain,
vd1129 = vd1130,
i_0_23 ).
cnf(c_0_85,plain,
vd1129 = vd1123,
i_0_2 ).
cnf(c_0_86,plain,
( X1 = X2
| rcenter(X1,esk3_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_43 ).
cnf(c_0_87,plain,
rpoint(vd1130),
i_0_22 ).
cnf(c_0_88,plain,
vd1130 = vd1123,
inference(rw,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
( ~ rcircle(X1)
| ~ rline(X2)
| ~ ron(vd1127,X1)
| ~ ron(vd1123,X2)
| ~ ron(vd1125,X2)
| ~ rcenter(vd1123,X1) ),
i_0_1 ).
cnf(c_0_90,plain,
( X1 = X2
| rcenter(X1,esk3_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_86])]) ).
cnf(c_0_91,plain,
rpoint(vd1123),
inference(rw,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_92,plain,
( X1 = X2
| ron(X1,esk5_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_67 ).
cnf(c_0_93,negated_conjecture,
( vd1123 = X1
| ~ rline(X2)
| ~ rcircle(esk3_2(vd1123,X1))
| ~ ron(vd1127,esk3_2(vd1123,X1))
| ~ ron(vd1123,X2)
| ~ ron(vd1125,X2)
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]) ).
cnf(c_0_94,plain,
( X1 = X2
| ron(X1,esk5_2(X2,X1))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_92])]) ).
cnf(c_0_95,plain,
( X1 = X2
| ron(X1,esk3_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_44 ).
cnf(c_0_96,plain,
rpoint(vd1128),
i_0_20 ).
cnf(c_0_97,plain,
vd1127 = vd1128,
i_0_21 ).
cnf(c_0_98,plain,
vd1127 != vd1129,
i_0_25 ).
cnf(c_0_99,plain,
( vd1123 = X1
| vd1123 = X2
| ~ rline(esk5_2(X1,vd1123))
| ~ rcircle(esk3_2(vd1123,X2))
| ~ ron(vd1127,esk3_2(vd1123,X2))
| ~ ron(vd1125,esk5_2(X1,vd1123))
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_91])]) ).
cnf(c_0_100,plain,
( X1 = X2
| ron(X1,esk3_2(X2,X1))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_95])]) ).
cnf(c_0_101,plain,
rpoint(vd1127),
inference(rw,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_102,plain,
vd1127 != vd1123,
inference(rw,[status(thm)],[c_0_98,c_0_85]) ).
cnf(c_0_103,plain,
( X1 = X2
| ron(X1,esk5_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_66 ).
cnf(c_0_104,plain,
rpoint(vd1126),
i_0_18 ).
cnf(c_0_105,plain,
vd1125 = vd1126,
i_0_19 ).
cnf(c_0_106,plain,
( vd1123 = X1
| ~ rline(esk5_2(X1,vd1123))
| ~ rcircle(esk3_2(vd1123,vd1127))
| ~ ron(vd1125,esk5_2(X1,vd1123))
| ~ rpoint(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]),c_0_91])]),c_0_102]) ).
cnf(c_0_107,plain,
( X1 = X2
| ron(X1,esk5_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_103])]) ).
cnf(c_0_108,plain,
rpoint(vd1125),
inference(rw,[status(thm)],[c_0_104,c_0_105]) ).
cnf(c_0_109,plain,
vd1125 != vd1123,
i_0_24 ).
cnf(c_0_110,plain,
( X1 = X2
| rcircle(esk3_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_42 ).
cnf(c_0_111,plain,
( ~ rline(esk5_2(vd1125,vd1123))
| ~ rcircle(esk3_2(vd1123,vd1127)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]),c_0_91])]),c_0_109]) ).
cnf(c_0_112,plain,
( X1 = X2
| rcircle(esk3_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_110])]) ).
cnf(c_0_113,plain,
( X1 = X2
| rline(esk5_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_65 ).
cnf(c_0_114,plain,
~ rline(esk5_2(vd1125,vd1123)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_91]),c_0_101])]),c_0_102]) ).
cnf(c_0_115,plain,
( X1 = X2
| rline(esk5_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_113])]) ).
cnf(c_0_116,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_108]),c_0_91])]),c_0_109]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO284+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 11:03:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.03/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.03/2.50 # No SInE strategy applied
% 8.03/2.50 # Trying AutoSched0 for 150 seconds
% 8.03/2.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.03/2.50 # and selection function SelectCQArNTNpEqFirst.
% 8.03/2.50 #
% 8.03/2.50 # Preprocessing time : 0.013 s
% 8.03/2.50 # Presaturation interreduction done
% 8.03/2.50
% 8.03/2.50 # Proof found!
% 8.03/2.50 # SZS status Theorem
% 8.03/2.50 # SZS output start CNFRefutation
% See solution above
% 8.03/2.50 # Training examples: 0 positive, 0 negative
% 8.03/2.50
% 8.03/2.50 # -------------------------------------------------
% 8.03/2.50 # User time : 0.018 s
% 8.03/2.50 # System time : 0.007 s
% 8.03/2.50 # Total time : 0.024 s
% 8.03/2.50 # Maximum resident set size: 7120 pages
% 8.03/2.50
%------------------------------------------------------------------------------