TSTP Solution File: GEO344+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO344+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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 8.06s 2.52s
% Output : CNFRefutation 8.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of clauses : 28 ( 24 unt; 4 nHn; 28 RR)
% Number of literals : 69 ( 22 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_36,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-ufybdtl4/lgb.p',i_0_36) ).
cnf(i_0_19,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_19) ).
cnf(i_0_20,plain,
vd1401 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_20) ).
cnf(i_0_6,plain,
ron(vd1401,vd1419),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_6) ).
cnf(i_0_5,plain,
rline(vd1419),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
ron(vd1409,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_4) ).
cnf(i_0_14,plain,
rpoint(vd1409),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_14) ).
cnf(i_0_2,negated_conjecture,
rline(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
ron(vd1401,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_3) ).
cnf(i_0_7,plain,
ron(vd1409,vd1419),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_7) ).
cnf(i_0_13,plain,
vd1409 != vd1401,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_13) ).
cnf(i_0_1,negated_conjecture,
esk1_0 != vd1419,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ufybdtl4/lgb.p',i_0_1) ).
cnf(c_0_49,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_36 ).
cnf(c_0_50,plain,
rpoint(esk2_0),
i_0_19 ).
cnf(c_0_51,plain,
vd1401 = esk2_0,
i_0_20 ).
cnf(c_0_52,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_49])])])]) ).
cnf(c_0_53,plain,
ron(vd1401,vd1419),
i_0_6 ).
cnf(c_0_54,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
rline(vd1419),
i_0_5 ).
cnf(c_0_56,plain,
( X1 = vd1401
| X2 = vd1419
| ~ rpoint(X1)
| ~ rline(X2)
| ~ ron(vd1401,X2)
| ~ ron(X1,vd1419)
| ~ ron(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
ron(vd1409,esk1_0),
i_0_4 ).
cnf(c_0_58,plain,
rpoint(vd1409),
i_0_14 ).
cnf(c_0_59,negated_conjecture,
rline(esk1_0),
i_0_2 ).
cnf(c_0_60,negated_conjecture,
ron(vd1401,esk1_0),
i_0_3 ).
cnf(c_0_61,plain,
ron(vd1409,vd1419),
i_0_7 ).
cnf(c_0_62,plain,
vd1409 != vd1401,
i_0_13 ).
cnf(c_0_63,negated_conjecture,
esk1_0 != vd1419,
i_0_1 ).
cnf(c_0_64,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_56,c_0_57]),c_0_58]),c_0_59]),c_0_60]),c_0_61])]),c_0_62]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GEO344+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n024.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 15:57:04 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.06/2.52 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.06/2.52 # No SInE strategy applied
% 8.06/2.52 # Trying AutoSched0 for 150 seconds
% 8.06/2.52 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 8.06/2.52 # and selection function SelectCQArNTNpEqFirst.
% 8.06/2.52 #
% 8.06/2.52 # Preprocessing time : 0.013 s
% 8.06/2.52 # Presaturation interreduction done
% 8.06/2.52
% 8.06/2.52 # Proof found!
% 8.06/2.52 # SZS status Theorem
% 8.06/2.52 # SZS output start CNFRefutation
% See solution above
% 8.06/2.52 # Training examples: 0 positive, 0 negative
% 8.06/2.52
% 8.06/2.52 # -------------------------------------------------
% 8.06/2.52 # User time : 0.036 s
% 8.06/2.52 # System time : 0.004 s
% 8.06/2.52 # Total time : 0.040 s
% 8.06/2.52 # Maximum resident set size: 7120 pages
% 8.06/2.52
%------------------------------------------------------------------------------