TSTP Solution File: GEO343+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO343+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:24 EDT 2022
% Result : Theorem 7.47s 2.84s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 31 ( 27 unt; 4 nHn; 31 RR)
% Number of literals : 72 ( 24 equ; 41 neg)
% Maximal clause size : 14 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_122,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/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_122) ).
cnf(i_0_13,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_13) ).
cnf(i_0_14,plain,
vd1401 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_14) ).
cnf(i_0_6,plain,
ron(vd1401,vd1416),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
rline(vd1416),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_5) ).
cnf(i_0_9,plain,
rpoint(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_9) ).
cnf(i_0_10,plain,
vd1399 = esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_10) ).
cnf(i_0_4,negated_conjecture,
ron(vd1399,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
rline(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
ron(vd1401,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
ron(vd1399,vd1416),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_7) ).
cnf(i_0_16,plain,
vd1399 != vd1401,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_16) ).
cnf(i_0_1,negated_conjecture,
esk1_0 != vd1416,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gr_dy1n0/lgb.p',i_0_1) ).
cnf(c_0_136,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_122 ).
cnf(c_0_137,plain,
rpoint(esk2_0),
i_0_13 ).
cnf(c_0_138,plain,
vd1401 = esk2_0,
i_0_14 ).
cnf(c_0_139,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_136])])])]) ).
cnf(c_0_140,plain,
ron(vd1401,vd1416),
i_0_6 ).
cnf(c_0_141,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_137,c_0_138]) ).
cnf(c_0_142,plain,
rline(vd1416),
i_0_5 ).
cnf(c_0_143,plain,
rpoint(esk4_0),
i_0_9 ).
cnf(c_0_144,plain,
vd1399 = esk4_0,
i_0_10 ).
cnf(c_0_145,plain,
( X1 = vd1401
| X2 = vd1416
| ~ rpoint(X1)
| ~ rline(X2)
| ~ ron(vd1401,X2)
| ~ ron(X1,vd1416)
| ~ ron(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]),c_0_142])]) ).
cnf(c_0_146,negated_conjecture,
ron(vd1399,esk1_0),
i_0_4 ).
cnf(c_0_147,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_143,c_0_144]) ).
cnf(c_0_148,negated_conjecture,
rline(esk1_0),
i_0_2 ).
cnf(c_0_149,negated_conjecture,
ron(vd1401,esk1_0),
i_0_3 ).
cnf(c_0_150,plain,
ron(vd1399,vd1416),
i_0_7 ).
cnf(c_0_151,plain,
vd1399 != vd1401,
i_0_16 ).
cnf(c_0_152,negated_conjecture,
esk1_0 != vd1416,
i_0_1 ).
cnf(c_0_153,negated_conjecture,
$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(spm,[status(thm)],[c_0_145,c_0_146]),c_0_147]),c_0_148]),c_0_149]),c_0_150])]),c_0_151]),c_0_152]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO343+1 : TPTP v8.1.0. Released v4.1.0.
% 0.08/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n014.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 17 16:31:36 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 7.47/2.84 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.84 # No SInE strategy applied
% 7.47/2.84 # Trying AutoSched0 for 150 seconds
% 7.47/2.84 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 7.47/2.84 # and selection function SelectCQArNTNpEqFirst.
% 7.47/2.84 #
% 7.47/2.84 # Preprocessing time : 0.013 s
% 7.47/2.84 # Presaturation interreduction done
% 7.47/2.84
% 7.47/2.84 # Proof found!
% 7.47/2.84 # SZS status Theorem
% 7.47/2.84 # SZS output start CNFRefutation
% See solution above
% 7.47/2.84 # Training examples: 0 positive, 0 negative
% 7.47/2.84
% 7.47/2.84 # -------------------------------------------------
% 7.47/2.84 # User time : 0.050 s
% 7.47/2.84 # System time : 0.010 s
% 7.47/2.84 # Total time : 0.060 s
% 7.47/2.84 # Maximum resident set size: 7124 pages
% 7.47/2.84
%------------------------------------------------------------------------------