TSTP Solution File: GEO274+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO274+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:04 EDT 2022
% Result : Theorem 8.25s 2.50s
% Output : CNFRefutation 8.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of clauses : 50 ( 36 unt; 4 nHn; 50 RR)
% Number of literals : 126 ( 58 equ; 78 neg)
% Maximal clause size : 14 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_16) ).
cnf(i_0_14,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_14) ).
cnf(i_0_15,plain,
vd1080 = esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_15) ).
cnf(i_0_18,plain,
( X1 = X2
| X2 != X3
| X1 != X4
| vf(X1,X2) != v0
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_18) ).
cnf(i_0_13,plain,
rpoint(vd1086),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_13) ).
cnf(i_0_11,plain,
vd1086 = vd1085,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_11) ).
cnf(i_0_121,plain,
( X1 = X2
| X3 = X4
| X4 != X5
| X2 != X6
| X1 != X7
| X3 != X8
| ~ rline(X6)
| ~ rline(X7)
| ~ rpoint(X5)
| ~ rpoint(X8)
| ~ ron(X4,X2)
| ~ ron(X4,X1)
| ~ ron(X3,X2)
| ~ ron(X3,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_121) ).
cnf(i_0_8,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_8) ).
cnf(i_0_12,plain,
vd1080 != vd1085,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_12) ).
cnf(i_0_10,plain,
rpoint(vd1089),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_10) ).
cnf(i_0_6,plain,
ron(vd1080,vd1092),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
rline(vd1092),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_5) ).
cnf(i_0_17,plain,
( vf(X1,X2) = v0
| X2 != X3
| X1 != X4
| X1 != X2
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_17) ).
cnf(i_0_4,negated_conjecture,
ron(vd1089,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
rline(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
ron(vd1080,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
ron(vd1089,vd1092),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_7) ).
cnf(i_0_1,negated_conjecture,
esk1_0 != vd1092,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-31q8qs_n/lgb.p',i_0_1) ).
cnf(c_0_140,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_16 ).
cnf(c_0_141,plain,
rpoint(esk2_0),
i_0_14 ).
cnf(c_0_142,plain,
vd1080 = esk2_0,
i_0_15 ).
cnf(c_0_143,plain,
( X1 = X2
| X2 != X3
| X1 != X4
| vf(X1,X2) != v0
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_18 ).
cnf(c_0_144,plain,
rpoint(vd1086),
i_0_13 ).
cnf(c_0_145,plain,
vd1086 = vd1085,
i_0_11 ).
cnf(c_0_146,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_140])]) ).
cnf(c_0_147,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_141,c_0_142]) ).
cnf(c_0_148,plain,
( X1 = X2
| X3 = X4
| X4 != X5
| X2 != X6
| X1 != X7
| X3 != X8
| ~ rline(X6)
| ~ rline(X7)
| ~ rpoint(X5)
| ~ rpoint(X8)
| ~ ron(X4,X2)
| ~ ron(X4,X1)
| ~ ron(X3,X2)
| ~ ron(X3,X1) ),
i_0_121 ).
cnf(c_0_149,plain,
( X1 = X2
| vf(X1,X2) != v0
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_143])]) ).
cnf(c_0_150,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
i_0_8 ).
cnf(c_0_151,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_152,plain,
vd1080 != vd1085,
i_0_12 ).
cnf(c_0_153,plain,
( vf(X1,vd1080) = vf(vd1080,X1)
| ~ rpoint(X1) ),
inference(spm,[status(thm)],[c_0_146,c_0_147]) ).
cnf(c_0_154,plain,
rpoint(vd1089),
i_0_10 ).
cnf(c_0_155,plain,
( X1 = X2
| X3 = X4
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rline(X3)
| ~ rline(X4)
| ~ ron(X2,X4)
| ~ ron(X2,X3)
| ~ ron(X1,X4)
| ~ ron(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_148])])])]) ).
cnf(c_0_156,plain,
ron(vd1080,vd1092),
i_0_6 ).
cnf(c_0_157,plain,
rline(vd1092),
i_0_5 ).
cnf(c_0_158,plain,
( vf(X1,X2) = v0
| X2 != X3
| X1 != X4
| X1 != X2
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_17 ).
cnf(c_0_159,plain,
vf(vd1089,vd1080) != v0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_151]),c_0_147])]),c_0_152]) ).
cnf(c_0_160,plain,
vf(vd1089,vd1080) = vf(vd1080,vd1089),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_161,plain,
( X1 = vd1080
| X2 = vd1092
| ~ rpoint(X1)
| ~ rline(X2)
| ~ ron(vd1080,X2)
| ~ ron(X1,vd1092)
| ~ ron(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_147]),c_0_157])]) ).
cnf(c_0_162,negated_conjecture,
ron(vd1089,esk1_0),
i_0_4 ).
cnf(c_0_163,negated_conjecture,
rline(esk1_0),
i_0_2 ).
cnf(c_0_164,negated_conjecture,
ron(vd1080,esk1_0),
i_0_3 ).
cnf(c_0_165,plain,
ron(vd1089,vd1092),
i_0_7 ).
cnf(c_0_166,negated_conjecture,
esk1_0 != vd1092,
i_0_1 ).
cnf(c_0_167,plain,
( vf(X1,X1) = v0
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_158])])]) ).
cnf(c_0_168,plain,
vf(vd1080,vd1089) != v0,
inference(rw,[status(thm)],[c_0_159,c_0_160]) ).
cnf(c_0_169,negated_conjecture,
vd1089 = vd1080,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_162]),c_0_154]),c_0_163]),c_0_164]),c_0_165])]),c_0_166]) ).
cnf(c_0_170,plain,
vf(vd1080,vd1080) = v0,
inference(spm,[status(thm)],[c_0_167,c_0_147]) ).
cnf(c_0_171,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_168,c_0_169]),c_0_170])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO274+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 : n020.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 13:22:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.46 # ENIGMATIC: Selected complete mode:
% 8.25/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.25/2.50 # No SInE strategy applied
% 8.25/2.50 # Trying AutoSched0 for 150 seconds
% 8.25/2.50 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.25/2.50 # and selection function SelectCQArNTNpEqFirst.
% 8.25/2.50 #
% 8.25/2.50 # Preprocessing time : 0.014 s
% 8.25/2.50 # Presaturation interreduction done
% 8.25/2.50
% 8.25/2.50 # Proof found!
% 8.25/2.50 # SZS status Theorem
% 8.25/2.50 # SZS output start CNFRefutation
% See solution above
% 8.25/2.50 # Training examples: 0 positive, 0 negative
% 8.25/2.50
% 8.25/2.50 # -------------------------------------------------
% 8.25/2.50 # User time : 0.079 s
% 8.25/2.50 # System time : 0.007 s
% 8.25/2.50 # Total time : 0.086 s
% 8.25/2.50 # Maximum resident set size: 7128 pages
% 8.25/2.50
%------------------------------------------------------------------------------