TSTP Solution File: GEO340+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO340+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:23 EDT 2022
% Result : Theorem 7.70s 2.49s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of clauses : 55 ( 45 unt; 7 nHn; 55 RR)
% Number of literals : 157 ( 84 equ; 92 neg)
% Maximal clause size : 20 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-7 aty)
% Number of variables : 53 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( X1 = X2
| X3 = X1
| X4 = X1
| X4 = X3
| X1 != X5
| X3 != X6
| X4 != X7
| X8 != X9
| vf(X3,X1) != vf(X3,X2)
| vf(X4,X1) != vf(X4,X2)
| X10 != vskolem1416(X2,X3,X4,X1,X8,X9)
| X11 != vskolem1419(X10,X2,X3,X4,X1,X8,X9)
| ~ rpoint(X2)
| ~ rpoint(X6)
| ~ rpoint(X7)
| ~ rpoint(X5)
| ~ rline(X9)
| ~ ron(X3,X8)
| ~ ron(X4,X8)
| ~ rS(X1,X2,X8) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_19) ).
cnf(i_0_64,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_64) ).
cnf(i_0_6,plain,
rpoint(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_6) ).
cnf(i_0_7,plain,
vd1384 = esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_7) ).
cnf(i_0_15,plain,
rline(vd1392),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_15) ).
cnf(i_0_18,plain,
vd1392 = vd1391,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_18) ).
cnf(i_0_10,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_10) ).
cnf(i_0_11,plain,
vd1386 = esk2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_11) ).
cnf(i_0_3,negated_conjecture,
vf(vd1384,esk1_0) = vf(vd1384,vd1386),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
rpoint(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_1) ).
cnf(i_0_8,plain,
rpoint(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_8) ).
cnf(i_0_9,plain,
vd1385 = esk3_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_9) ).
cnf(i_0_2,negated_conjecture,
rS(vd1386,esk1_0,vd1391),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
esk1_0 != vd1386,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
vf(vd1385,esk1_0) = vf(vd1385,vd1386),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_4) ).
cnf(i_0_16,plain,
ron(vd1384,vd1391),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_16) ).
cnf(i_0_13,plain,
vd1384 != vd1386,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_13) ).
cnf(i_0_17,plain,
ron(vd1385,vd1391),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_17) ).
cnf(i_0_12,plain,
vd1384 != vd1385,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_12) ).
cnf(i_0_14,plain,
vd1385 != vd1386,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kn_y9l/lgb.p',i_0_14) ).
cnf(c_0_85,plain,
( X1 = X2
| X3 = X1
| X4 = X1
| X4 = X3
| X1 != X5
| X3 != X6
| X4 != X7
| X8 != X9
| vf(X3,X1) != vf(X3,X2)
| vf(X4,X1) != vf(X4,X2)
| X10 != vskolem1416(X2,X3,X4,X1,X8,X9)
| X11 != vskolem1419(X10,X2,X3,X4,X1,X8,X9)
| ~ rpoint(X2)
| ~ rpoint(X6)
| ~ rpoint(X7)
| ~ rpoint(X5)
| ~ rline(X9)
| ~ ron(X3,X8)
| ~ ron(X4,X8)
| ~ rS(X1,X2,X8) ),
i_0_19 ).
cnf(c_0_86,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X3 = X4
| X5 != vskolem1419(X6,X4,X1,X2,X3,X7,X7)
| X6 != vskolem1416(X4,X1,X2,X3,X7,X7)
| vf(X2,X3) != vf(X2,X4)
| vf(X1,X3) != vf(X1,X4)
| ~ ron(X2,X7)
| ~ ron(X1,X7)
| ~ rline(X7)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rS(X3,X4,X7) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_85])])])]) ).
cnf(c_0_87,plain,
( vf(X1,X2) = vf(X2,X1)
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_64 ).
cnf(c_0_88,plain,
rpoint(esk4_0),
i_0_6 ).
cnf(c_0_89,plain,
vd1384 = esk4_0,
i_0_7 ).
cnf(c_0_90,plain,
( X1 = X2
| X1 = X3
| X1 = X4
| X3 = X4
| X5 != vskolem1416(X2,X3,X4,X1,X6,X6)
| vf(X4,X1) != vf(X4,X2)
| vf(X3,X1) != vf(X3,X2)
| ~ ron(X4,X6)
| ~ ron(X3,X6)
| ~ rline(X6)
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rS(X1,X2,X6) ),
inference(er,[status(thm)],[c_0_86]) ).
cnf(c_0_91,plain,
rline(vd1392),
i_0_15 ).
cnf(c_0_92,plain,
vd1392 = vd1391,
i_0_18 ).
cnf(c_0_93,plain,
rpoint(esk2_0),
i_0_10 ).
cnf(c_0_94,plain,
vd1386 = esk2_0,
i_0_11 ).
cnf(c_0_95,negated_conjecture,
vf(vd1384,esk1_0) = vf(vd1384,vd1386),
i_0_3 ).
cnf(c_0_96,plain,
( vf(X1,X2) = vf(X2,X1)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_87])]) ).
cnf(c_0_97,negated_conjecture,
rpoint(esk1_0),
i_0_1 ).
cnf(c_0_98,plain,
rpoint(vd1384),
inference(rw,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_99,plain,
rpoint(esk3_0),
i_0_8 ).
cnf(c_0_100,plain,
vd1385 = esk3_0,
i_0_9 ).
cnf(c_0_101,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X3 = X4
| vf(X2,X3) != vf(X2,X4)
| vf(X1,X3) != vf(X1,X4)
| ~ ron(X2,X5)
| ~ ron(X1,X5)
| ~ rline(X5)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| ~ rpoint(X4)
| ~ rS(X3,X4,X5) ),
inference(er,[status(thm)],[c_0_90]) ).
cnf(c_0_102,negated_conjecture,
rS(vd1386,esk1_0,vd1391),
i_0_2 ).
cnf(c_0_103,plain,
rline(vd1391),
inference(rw,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_104,plain,
rpoint(vd1386),
inference(rw,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_105,negated_conjecture,
esk1_0 != vd1386,
i_0_5 ).
cnf(c_0_106,negated_conjecture,
vf(vd1384,vd1386) = vf(esk1_0,vd1384),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_98])]) ).
cnf(c_0_107,negated_conjecture,
vf(vd1385,esk1_0) = vf(vd1385,vd1386),
i_0_4 ).
cnf(c_0_108,plain,
rpoint(vd1385),
inference(rw,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_109,negated_conjecture,
( vd1386 = X1
| vd1386 = X2
| X1 = X2
| vf(X2,esk1_0) != vf(X2,vd1386)
| vf(X1,esk1_0) != vf(X1,vd1386)
| ~ ron(X2,vd1391)
| ~ ron(X1,vd1391)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
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_101,c_0_102]),c_0_103]),c_0_104]),c_0_97])]),c_0_105]) ).
cnf(c_0_110,plain,
ron(vd1384,vd1391),
i_0_16 ).
cnf(c_0_111,plain,
vf(esk1_0,vd1384) = vf(vd1386,vd1384),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_106]),c_0_98]),c_0_104])]) ).
cnf(c_0_112,plain,
vd1384 != vd1386,
i_0_13 ).
cnf(c_0_113,negated_conjecture,
vf(vd1385,vd1386) = vf(esk1_0,vd1385),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_96]),c_0_97]),c_0_108])]) ).
cnf(c_0_114,plain,
( X1 = vd1384
| vd1386 = X1
| vf(X1,esk1_0) != vf(X1,vd1386)
| ~ ron(X1,vd1391)
| ~ rpoint(X1) ),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_95]),c_0_106]),c_0_111]),c_0_106]),c_0_111]),c_0_98])]),c_0_112]) ).
cnf(c_0_115,plain,
ron(vd1385,vd1391),
i_0_17 ).
cnf(c_0_116,plain,
vf(esk1_0,vd1385) = vf(vd1386,vd1385),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_113]),c_0_108]),c_0_104])]) ).
cnf(c_0_117,plain,
vd1384 != vd1385,
i_0_12 ).
cnf(c_0_118,plain,
vd1385 != vd1386,
i_0_14 ).
cnf(c_0_119,plain,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_107]),c_0_113]),c_0_116]),c_0_113]),c_0_116]),c_0_108])]),c_0_117]),c_0_118]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO340+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 : n023.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 16:26:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.70/2.49 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.70/2.49 # No SInE strategy applied
% 7.70/2.49 # Trying AutoSched0 for 150 seconds
% 7.70/2.49 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.70/2.49 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.70/2.49 #
% 7.70/2.49 # Preprocessing time : 0.023 s
% 7.70/2.49
% 7.70/2.49 # Proof found!
% 7.70/2.49 # SZS status Theorem
% 7.70/2.49 # SZS output start CNFRefutation
% See solution above
% 7.70/2.50 # Training examples: 0 positive, 0 negative
% 7.70/2.50
% 7.70/2.50 # -------------------------------------------------
% 7.70/2.50 # User time : 0.031 s
% 7.70/2.50 # System time : 0.004 s
% 7.70/2.50 # Total time : 0.035 s
% 7.70/2.50 # Maximum resident set size: 7128 pages
% 7.70/2.50
%------------------------------------------------------------------------------