TSTP Solution File: GEO342+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO342+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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.69s 2.45s
% Output : CNFRefutation 7.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 26 ( 13 unt; 9 nHn; 26 RR)
% Number of literals : 74 ( 29 equ; 43 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_65,plain,
( X1 = X2
| ron(X1,esk8_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_65) ).
cnf(i_0_8,plain,
rpoint(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_8) ).
cnf(i_0_9,plain,
vd1399 = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_9) ).
cnf(i_0_1,negated_conjecture,
( ~ rline(X1)
| ~ ron(vd1399,X1)
| ~ ron(vd1401,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_1) ).
cnf(i_0_63,plain,
( X1 = X2
| rline(esk8_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_63) ).
cnf(i_0_64,plain,
( X1 = X2
| ron(X1,esk8_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_64) ).
cnf(i_0_12,plain,
rpoint(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_12) ).
cnf(i_0_13,plain,
vd1401 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_13) ).
cnf(i_0_15,plain,
vd1399 != vd1401,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-u69b8yf5/lgb.p',i_0_15) ).
cnf(c_0_75,plain,
( X1 = X2
| ron(X1,esk8_2(X2,X1))
| X2 != X3
| X1 != X4
| ~ rpoint(X3)
| ~ rpoint(X4) ),
i_0_65 ).
cnf(c_0_76,plain,
rpoint(esk3_0),
i_0_8 ).
cnf(c_0_77,plain,
vd1399 = esk3_0,
i_0_9 ).
cnf(c_0_78,negated_conjecture,
( ~ rline(X1)
| ~ ron(vd1399,X1)
| ~ ron(vd1401,X1) ),
i_0_1 ).
cnf(c_0_79,plain,
( X1 = X2
| ron(X1,esk8_2(X2,X1))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_75])]) ).
cnf(c_0_80,plain,
rpoint(vd1399),
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( X1 = X2
| rline(esk8_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_63 ).
cnf(c_0_82,negated_conjecture,
( vd1399 = X1
| ~ ron(vd1401,esk8_2(X1,vd1399))
| ~ rline(esk8_2(X1,vd1399))
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_83,plain,
( X1 = X2
| rline(esk8_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_81])]) ).
cnf(c_0_84,plain,
( X1 = X2
| ron(X1,esk8_2(X1,X2))
| X2 != X3
| X1 != X4
| ~ rpoint(X4)
| ~ rpoint(X3) ),
i_0_64 ).
cnf(c_0_85,plain,
rpoint(esk1_0),
i_0_12 ).
cnf(c_0_86,plain,
vd1401 = esk1_0,
i_0_13 ).
cnf(c_0_87,plain,
( vd1399 = X1
| ~ ron(vd1401,esk8_2(X1,vd1399))
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_80])]) ).
cnf(c_0_88,plain,
( X1 = X2
| ron(X1,esk8_2(X1,X2))
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_84])]) ).
cnf(c_0_89,plain,
rpoint(vd1401),
inference(rw,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
vd1399 != vd1401,
i_0_15 ).
cnf(c_0_91,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_80])]),c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GEO342+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jun 17 23:55:09 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 7.69/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.45 # No SInE strategy applied
% 7.69/2.45 # Trying AutoSched0 for 150 seconds
% 7.69/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S080N
% 7.69/2.45 # and selection function SelectCQIArNXTEqFirst.
% 7.69/2.45 #
% 7.69/2.45 # Preprocessing time : 0.019 s
% 7.69/2.45 # Presaturation interreduction done
% 7.69/2.45
% 7.69/2.45 # Proof found!
% 7.69/2.45 # SZS status Theorem
% 7.69/2.45 # SZS output start CNFRefutation
% See solution above
% 7.69/2.45 # Training examples: 0 positive, 0 negative
% 7.69/2.45
% 7.69/2.45 # -------------------------------------------------
% 7.69/2.45 # User time : 0.029 s
% 7.69/2.45 # System time : 0.006 s
% 7.69/2.45 # Total time : 0.034 s
% 7.69/2.45 # Maximum resident set size: 7124 pages
% 7.69/2.45
%------------------------------------------------------------------------------