TSTP Solution File: GEO273+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GEO273+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:03 EDT 2022
% Result : Theorem 8.40s 2.55s
% Output : CNFRefutation 8.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 22 unt; 12 nHn; 36 RR)
% Number of literals : 155 ( 109 equ; 97 neg)
% Maximal clause size : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-8 aty)
% Number of variables : 82 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X2,vskolem1103(X4,X5,X6,X7,X2,X8,X3,X1)) = vf(X3,X1)
| X2 != X8
| X1 != X9
| X3 != X10
| X7 != vskolem1092(X2,X8,X3,X1)
| X6 != vskolem1095(X7,X2,X8,X3,X1)
| X5 != vskolem1099(X6,X7,X2,X8,X3,X1)
| X4 != vskolem1102(X5,X6,X7,X2,X8,X3,X1)
| ~ rpoint(X8)
| ~ rpoint(X10)
| ~ rpoint(X9) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_11) ).
cnf(i_0_5,plain,
rpoint(vd1075),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_5) ).
cnf(i_0_2,plain,
vd1075 = vd1074,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( vf(vd1069,vd1070) != vf(vd1074,X1)
| ~ rpoint(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_1) ).
cnf(i_0_18,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rpoint(vskolem1103(X4,X5,X6,X7,X2,X8,X3,X1))
| X2 != X8
| X1 != X9
| X3 != X10
| X7 != vskolem1092(X2,X8,X3,X1)
| X6 != vskolem1095(X7,X2,X8,X3,X1)
| X5 != vskolem1099(X6,X7,X2,X8,X3,X1)
| X4 != vskolem1102(X5,X6,X7,X2,X8,X3,X1)
| ~ rpoint(X8)
| ~ rpoint(X10)
| ~ rpoint(X9) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_18) ).
cnf(i_0_9,plain,
rpoint(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_9) ).
cnf(i_0_10,plain,
vd1069 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_10) ).
cnf(i_0_7,plain,
rpoint(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_7) ).
cnf(i_0_8,plain,
vd1070 = esk1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_8) ).
cnf(i_0_4,plain,
vd1069 != vd1074,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
vd1070 != vd1074,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_3) ).
cnf(i_0_6,plain,
vd1069 != vd1070,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8e4wr8x7/lgb.p',i_0_6) ).
cnf(c_0_31,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| vf(X2,vskolem1103(X4,X5,X6,X7,X2,X8,X3,X1)) = vf(X3,X1)
| X2 != X8
| X1 != X9
| X3 != X10
| X7 != vskolem1092(X2,X8,X3,X1)
| X6 != vskolem1095(X7,X2,X8,X3,X1)
| X5 != vskolem1099(X6,X7,X2,X8,X3,X1)
| X4 != vskolem1102(X5,X6,X7,X2,X8,X3,X1)
| ~ rpoint(X8)
| ~ rpoint(X10)
| ~ rpoint(X9) ),
i_0_11 ).
cnf(c_0_32,plain,
rpoint(vd1075),
i_0_5 ).
cnf(c_0_33,plain,
vd1075 = vd1074,
i_0_2 ).
cnf(c_0_34,negated_conjecture,
( vf(vd1069,vd1070) != vf(vd1074,X1)
| ~ rpoint(X1) ),
i_0_1 ).
cnf(c_0_35,plain,
( vf(X1,vskolem1103(X2,X3,X4,X5,X1,X1,X6,X7)) = vf(X6,X7)
| X1 = X6
| X7 = X6
| X7 = X1
| X2 != vskolem1102(X3,X4,X5,X1,X1,X6,X7)
| X3 != vskolem1099(X4,X5,X1,X1,X6,X7)
| X4 != vskolem1095(X5,X1,X1,X6,X7)
| X5 != vskolem1092(X1,X1,X6,X7)
| ~ rpoint(X6)
| ~ rpoint(X7)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])])]) ).
cnf(c_0_36,plain,
rpoint(vd1074),
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rpoint(vskolem1103(X4,X5,X6,X7,X2,X8,X3,X1))
| X2 != X8
| X1 != X9
| X3 != X10
| X7 != vskolem1092(X2,X8,X3,X1)
| X6 != vskolem1095(X7,X2,X8,X3,X1)
| X5 != vskolem1099(X6,X7,X2,X8,X3,X1)
| X4 != vskolem1102(X5,X6,X7,X2,X8,X3,X1)
| ~ rpoint(X8)
| ~ rpoint(X10)
| ~ rpoint(X9) ),
i_0_18 ).
cnf(c_0_38,negated_conjecture,
( X1 = vd1074
| vd1074 = X2
| X1 = X2
| X3 != vskolem1102(X4,X5,X6,vd1074,vd1074,X2,X1)
| X4 != vskolem1099(X5,X6,vd1074,vd1074,X2,X1)
| vf(X2,X1) != vf(vd1069,vd1070)
| X5 != vskolem1095(X6,vd1074,vd1074,X2,X1)
| X6 != vskolem1092(vd1074,vd1074,X2,X1)
| ~ rpoint(vskolem1103(X3,X4,X5,X6,vd1074,vd1074,X2,X1))
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| rpoint(vskolem1103(X4,X5,X6,X7,X1,X1,X2,X3))
| X4 != vskolem1102(X5,X6,X7,X1,X1,X2,X3)
| X5 != vskolem1099(X6,X7,X1,X1,X2,X3)
| X6 != vskolem1095(X7,X1,X1,X2,X3)
| X7 != vskolem1092(X1,X1,X2,X3)
| ~ rpoint(X2)
| ~ rpoint(X3)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])])]) ).
cnf(c_0_40,plain,
( vd1074 = X1
| X2 = vd1074
| X2 = X1
| X3 != vskolem1102(X4,X5,X6,vd1074,vd1074,X1,X2)
| X4 != vskolem1099(X5,X6,vd1074,vd1074,X1,X2)
| vf(X1,X2) != vf(vd1069,vd1070)
| X5 != vskolem1095(X6,vd1074,vd1074,X1,X2)
| X6 != vskolem1092(vd1074,vd1074,X1,X2)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_36])]) ).
cnf(c_0_41,plain,
( X1 = vd1074
| vd1074 = X2
| X1 = X2
| X3 != vskolem1099(X4,X5,vd1074,vd1074,X2,X1)
| vf(X2,X1) != vf(vd1069,vd1070)
| X4 != vskolem1095(X5,vd1074,vd1074,X2,X1)
| X5 != vskolem1092(vd1074,vd1074,X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_42,plain,
( vd1074 = X1
| X2 = vd1074
| X2 = X1
| vf(X1,X2) != vf(vd1069,vd1070)
| X3 != vskolem1095(X4,vd1074,vd1074,X1,X2)
| X4 != vskolem1092(vd1074,vd1074,X1,X2)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_43,plain,
( X1 = vd1074
| vd1074 = X2
| X1 = X2
| vf(X2,X1) != vf(vd1069,vd1070)
| X3 != vskolem1092(vd1074,vd1074,X2,X1)
| ~ rpoint(X2)
| ~ rpoint(X1) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_44,plain,
rpoint(esk2_0),
i_0_9 ).
cnf(c_0_45,plain,
vd1069 = esk2_0,
i_0_10 ).
cnf(c_0_46,plain,
rpoint(esk1_0),
i_0_7 ).
cnf(c_0_47,plain,
vd1070 = esk1_0,
i_0_8 ).
cnf(c_0_48,plain,
( vd1074 = X1
| X2 = vd1074
| X2 = X1
| vf(X1,X2) != vf(vd1069,vd1070)
| ~ rpoint(X1)
| ~ rpoint(X2) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
rpoint(vd1069),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
rpoint(vd1070),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
vd1069 != vd1074,
i_0_4 ).
cnf(c_0_52,plain,
vd1070 != vd1074,
i_0_3 ).
cnf(c_0_53,plain,
vd1069 != vd1070,
i_0_6 ).
cnf(c_0_54,plain,
$false,
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(er,[status(thm)],[c_0_48]),c_0_49]),c_0_50])]),c_0_51]),c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO273+1 : TPTP v8.1.0. Released v4.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n004.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 : Fri Jun 17 15:58:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.40/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.40/2.55 # No SInE strategy applied
% 8.40/2.55 # Trying AutoSched0 for 150 seconds
% 8.40/2.55 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.40/2.55 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.40/2.55 #
% 8.40/2.55 # Preprocessing time : 0.014 s
% 8.40/2.55
% 8.40/2.55 # Proof found!
% 8.40/2.55 # SZS status Theorem
% 8.40/2.55 # SZS output start CNFRefutation
% See solution above
% 8.40/2.55 # Training examples: 0 positive, 0 negative
% 8.40/2.55
% 8.40/2.55 # -------------------------------------------------
% 8.40/2.55 # User time : 0.017 s
% 8.40/2.55 # System time : 0.005 s
% 8.40/2.55 # Total time : 0.022 s
% 8.40/2.55 # Maximum resident set size: 7136 pages
% 8.40/2.55
%------------------------------------------------------------------------------