TSTP Solution File: GEO277+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO277+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:05 EDT 2022
% Result : Theorem 7.81s 2.40s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of clauses : 53 ( 39 unt; 4 nHn; 53 RR)
% Number of literals : 129 ( 61 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_40,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_40) ).
cnf(i_0_35,plain,
rpoint(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_35) ).
cnf(i_0_36,plain,
vd1080 = esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_36) ).
cnf(i_0_89,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-hjvh4bgi/lgb.p',i_0_89) ).
cnf(i_0_87,plain,
( X1 = X2
| X2 != X3
| X1 != X4
| vf(X1,X2) != v0
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_87) ).
cnf(i_0_17,plain,
rpoint(vd1086),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_17) ).
cnf(i_0_16,plain,
vd1085 = vd1086,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_16) ).
cnf(i_0_15,plain,
rpoint(vd1089),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_15) ).
cnf(i_0_6,plain,
ron(vd1089,vd1099),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
rline(vd1099),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_5) ).
cnf(i_0_86,plain,
( vf(X1,X2) = v0
| X2 != X3
| X1 != X4
| X1 != X2
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_86) ).
cnf(i_0_21,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_21) ).
cnf(i_0_24,plain,
vd1080 != vd1085,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_24) ).
cnf(i_0_22,plain,
vf(vd1089,vd1080) = vf(vd1089,vd1085),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_22) ).
cnf(i_0_4,negated_conjecture,
ron(vd1085,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
rline(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
ron(vd1089,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
ron(vd1085,vd1099),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_7) ).
cnf(i_0_1,negated_conjecture,
esk1_0 != vd1099,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hjvh4bgi/lgb.p',i_0_1) ).
cnf(c_0_109,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_40 ).
cnf(c_0_110,plain,
rpoint(esk4_0),
i_0_35 ).
cnf(c_0_111,plain,
vd1080 = esk4_0,
i_0_36 ).
cnf(c_0_112,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_109])]) ).
cnf(c_0_113,plain,
rpoint(vd1080),
inference(rw,[status(thm)],[c_0_110,c_0_111]) ).
cnf(c_0_114,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_89 ).
cnf(c_0_115,plain,
( X1 = X2
| X2 != X3
| X1 != X4
| vf(X1,X2) != v0
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_87 ).
cnf(c_0_116,plain,
rpoint(vd1086),
i_0_17 ).
cnf(c_0_117,plain,
vd1085 = vd1086,
i_0_16 ).
cnf(c_0_118,plain,
( vf(X1,vd1080) = vf(vd1080,X1)
| ~ rpoint(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_119,plain,
rpoint(vd1089),
i_0_15 ).
cnf(c_0_120,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_114])])])]) ).
cnf(c_0_121,plain,
ron(vd1089,vd1099),
i_0_6 ).
cnf(c_0_122,plain,
rline(vd1099),
i_0_5 ).
cnf(c_0_123,plain,
( vf(X1,X2) = v0
| X2 != X3
| X1 != X4
| X1 != X2
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_86 ).
cnf(c_0_124,plain,
( X1 = X2
| vf(X1,X2) != v0
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_115])]) ).
cnf(c_0_125,plain,
vf(vd1089,vd1080) = vf(vd1085,vd1080),
i_0_21 ).
cnf(c_0_126,plain,
rpoint(vd1085),
inference(rw,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_127,plain,
vd1080 != vd1085,
i_0_24 ).
cnf(c_0_128,plain,
vf(vd1089,vd1080) = vf(vd1089,vd1085),
i_0_22 ).
cnf(c_0_129,plain,
vf(vd1089,vd1080) = vf(vd1080,vd1089),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_130,plain,
( X1 = vd1089
| X2 = vd1099
| ~ rpoint(X1)
| ~ rline(X2)
| ~ ron(vd1089,X2)
| ~ ron(X1,vd1099)
| ~ ron(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_119]),c_0_122])]) ).
cnf(c_0_131,negated_conjecture,
ron(vd1085,esk1_0),
i_0_4 ).
cnf(c_0_132,negated_conjecture,
rline(esk1_0),
i_0_2 ).
cnf(c_0_133,negated_conjecture,
ron(vd1089,esk1_0),
i_0_3 ).
cnf(c_0_134,plain,
ron(vd1085,vd1099),
i_0_7 ).
cnf(c_0_135,negated_conjecture,
esk1_0 != vd1099,
i_0_1 ).
cnf(c_0_136,plain,
( vf(X1,X1) = v0
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_123])])]) ).
cnf(c_0_137,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_124,c_0_125]),c_0_126]),c_0_113])]),c_0_127]) ).
cnf(c_0_138,plain,
vf(vd1089,vd1085) = vf(vd1080,vd1089),
inference(rw,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_139,negated_conjecture,
vd1085 = vd1089,
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_130,c_0_131]),c_0_126]),c_0_132]),c_0_133]),c_0_134])]),c_0_135]) ).
cnf(c_0_140,plain,
vf(vd1089,vd1089) = v0,
inference(spm,[status(thm)],[c_0_136,c_0_119]) ).
cnf(c_0_141,plain,
vf(vd1080,vd1089) != v0,
inference(rw,[status(thm)],[c_0_137,c_0_129]) ).
cnf(c_0_142,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_138,c_0_139]),c_0_140]),c_0_141]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO277+1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n014.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 16:45:35 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.81/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.40 # No SInE strategy applied
% 7.81/2.40 # Trying AutoSched0 for 150 seconds
% 7.81/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.81/2.40 # and selection function SelectCQArNTNpEqFirst.
% 7.81/2.40 #
% 7.81/2.40 # Preprocessing time : 0.024 s
% 7.81/2.40 # Presaturation interreduction done
% 7.81/2.40
% 7.81/2.40 # Proof found!
% 7.81/2.40 # SZS status Theorem
% 7.81/2.40 # SZS output start CNFRefutation
% See solution above
% 7.81/2.40 # Training examples: 0 positive, 0 negative
% 7.81/2.40
% 7.81/2.40 # -------------------------------------------------
% 7.81/2.40 # User time : 0.076 s
% 7.81/2.40 # System time : 0.009 s
% 7.81/2.40 # Total time : 0.085 s
% 7.81/2.40 # Maximum resident set size: 7124 pages
% 7.81/2.40
%------------------------------------------------------------------------------