TSTP Solution File: GEO331+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO331+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:21 EDT 2022
% Result : Theorem 9.17s 2.77s
% Output : CNFRefutation 9.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 26 unt; 6 nHn; 32 RR)
% Number of literals : 93 ( 58 equ; 47 neg)
% Maximal clause size : 13 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X3,X1) = vf(X3,X2)
| X2 != X4
| X1 != X5
| X3 != X6
| vangle(X3,X1,X2) != vangle(X3,X2,X1)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rpoint(X4)
| ~ rless(vf(X3,X2),vf(X3,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_14) ).
cnf(i_0_12,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X3,X1) = vf(X3,X2)
| rless(vf(X3,X2),vf(X3,X1))
| rless(vf(X3,X1),vf(X3,X2))
| X2 != X4
| X1 != X5
| X3 != X6
| vangle(X3,X1,X2) != vangle(X3,X2,X1)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rpoint(X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_12) ).
cnf(i_0_10,plain,
rpoint(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_10) ).
cnf(i_0_11,plain,
vd1352 = esk3_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_11) ).
cnf(i_0_8,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_8) ).
cnf(i_0_9,plain,
vd1353 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_9) ).
cnf(i_0_6,plain,
rpoint(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_6) ).
cnf(i_0_7,plain,
vd1354 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_7) ).
cnf(i_0_2,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_1) ).
cnf(i_0_3,plain,
vd1353 != vd1354,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_3) ).
cnf(i_0_5,plain,
vd1352 != vd1353,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
vd1352 != vd1354,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8osi4_b3/lgb.p',i_0_4) ).
cnf(c_0_28,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X3,X1) = vf(X3,X2)
| X2 != X4
| X1 != X5
| X3 != X6
| vangle(X3,X1,X2) != vangle(X3,X2,X1)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rpoint(X4)
| ~ rless(vf(X3,X2),vf(X3,X1)) ),
i_0_14 ).
cnf(c_0_29,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X3,X1) = vf(X3,X2)
| rless(vf(X3,X2),vf(X3,X1))
| rless(vf(X3,X1),vf(X3,X2))
| X2 != X4
| X1 != X5
| X3 != X6
| vangle(X3,X1,X2) != vangle(X3,X2,X1)
| ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rpoint(X4) ),
i_0_12 ).
cnf(c_0_30,plain,
( vf(X1,X2) = vf(X1,X3)
| X3 = X1
| X2 = X1
| X2 = X3
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rless(vf(X1,X3),vf(X1,X2)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_28])])]) ).
cnf(c_0_31,plain,
rpoint(esk3_0),
i_0_10 ).
cnf(c_0_32,plain,
vd1352 = esk3_0,
i_0_11 ).
cnf(c_0_33,plain,
rpoint(esk2_0),
i_0_8 ).
cnf(c_0_34,plain,
vd1353 = esk2_0,
i_0_9 ).
cnf(c_0_35,plain,
rpoint(esk1_0),
i_0_6 ).
cnf(c_0_36,plain,
vd1354 = esk1_0,
i_0_7 ).
cnf(c_0_37,plain,
( vf(X1,X2) = vf(X1,X3)
| X3 = X1
| X2 = X1
| X2 = X3
| vangle(X1,X2,X3) != vangle(X1,X3,X2)
| ~ rpoint(X1)
| ~ rpoint(X2)
| ~ rpoint(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_29])])]),c_0_30]),c_0_30]) ).
cnf(c_0_38,plain,
vangle(vd1352,vd1353,vd1354) = vangle(vd1352,vd1354,vd1353),
i_0_2 ).
cnf(c_0_39,plain,
rpoint(vd1352),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
rpoint(vd1353),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
rpoint(vd1354),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
vf(vd1352,vd1353) != vf(vd1352,vd1354),
i_0_1 ).
cnf(c_0_43,plain,
vd1353 != vd1354,
i_0_3 ).
cnf(c_0_44,plain,
vd1352 != vd1353,
i_0_5 ).
cnf(c_0_45,plain,
vd1352 != vd1354,
i_0_4 ).
cnf(c_0_46,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_41])]),c_0_42]),c_0_43]),c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO331+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 15:57:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 9.17/2.77 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.17/2.77 # No SInE strategy applied
% 9.17/2.77 # Trying AutoSched0 for 150 seconds
% 9.17/2.77 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 9.17/2.77 # and selection function SelectCQArNTNpEqFirst.
% 9.17/2.77 #
% 9.17/2.77 # Preprocessing time : 0.024 s
% 9.17/2.77 # Presaturation interreduction done
% 9.17/2.77
% 9.17/2.77 # Proof found!
% 9.17/2.77 # SZS status Theorem
% 9.17/2.77 # SZS output start CNFRefutation
% See solution above
% 9.17/2.77 # Training examples: 0 positive, 0 negative
% 9.17/2.77
% 9.17/2.77 # -------------------------------------------------
% 9.17/2.77 # User time : 0.036 s
% 9.17/2.77 # System time : 0.006 s
% 9.17/2.77 # Total time : 0.041 s
% 9.17/2.77 # Maximum resident set size: 7120 pages
% 9.17/2.77
%------------------------------------------------------------------------------