%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO298+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:28:07 PM UTC 2026
% Result : Theorem 12.75s 2.35s
% Output : CNFRefutation 12.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 69 ( 40 unt; 0 def)
% Number of atoms : 332 ( 129 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 408 ( 145 ~; 135 |; 122 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 16 con; 0-3 aty)
% Number of variables : 109 ( 0 sgn 45 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof('qu(cond(axiom(91), 0), imp(cond(axiom(91), 0)))',axiom,
! [X1,X2,X3,X4,X5] :
( ( ? [X8] :
( rpoint(X8)
& X1 = X8 )
& ? [X7] :
( rpoint(X7)
& X2 = X7 )
& ? [X6] :
( rpoint(X6)
& X3 = X6 )
& X1 != X2
& X1 != X3
& X2 != X3
& rline(X5)
& ron(X1,X4)
& ron(X2,X4)
& ron(X3,X4)
& X4 = X5 )
=> ( rR(X3,X1,X2)
| rR(X1,X2,X3)
| rR(X2,X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(91), 0), imp(cond(axiom(91), 0)))') ).
fof('and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))',axiom,
( ? [X16] :
( rpoint(X16)
& vd1178 = X16 )
& ? [X15] :
( rpoint(X15)
& vd1179 = X15 )
& ? [X14] :
( rpoint(X14)
& vd1180 = X14 )
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& ? [X13] :
( rpoint(X13)
& vd1185 = X13 )
& ? [X12] :
( rpoint(X12)
& vd1186 = X12 )
& ? [X11] :
( rpoint(X11)
& vd1187 = X11 )
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ~ ? [X10] :
( rline(X10)
& ron(vd1185,X10)
& ron(vd1186,X10)
& ron(vd1187,X10) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).
fof('qe(s3(plural(271)))',axiom,
? [X9] :
( rpoint(X9)
& vd1201 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s3(plural(271)))') ).
fof('holds(320, 1251, 0)',axiom,
vd1201 != vd1187,
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(320, 1251, 0)') ).
fof('qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))',axiom,
! [X276,X277,X278] :
( ( ? [X281] :
( rpoint(X281)
& X276 = X281 )
& ? [X280] :
( rpoint(X280)
& X277 = X280 )
& ? [X279] :
( rpoint(X279)
& X278 = X279 )
& rR(X277,X276,X278) )
=> ( rR(X277,X278,X276)
& X276 != X277
& X276 != X278
& ~ rR(X276,X277,X278) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))') ).
fof('pred(s3(plural(315)), 0)',axiom,
ron(vd1187,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s3(plural(315)), 0)') ).
fof('pred(293, 0)',axiom,
rline(vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(293, 0)') ).
fof('pred(s2(plural(315)), 0)',axiom,
ron(vd1201,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s2(plural(315)), 0)') ).
fof('dis(321)',conjecture,
( rR(vd1187,vd1185,vd1201)
| rR(vd1201,vd1185,vd1187) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(321)') ).
fof('pred(s1(plural(315)), 0)',axiom,
ron(vd1185,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s1(plural(315)), 0)') ).
fof('qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))',axiom,
! [X74,X75,X76,X77] :
( ( ? [X79] :
( rpoint(X79)
& X74 = X79 )
& ? [X78] :
( rpoint(X78)
& X75 = X78 )
& rline(X77)
& X76 = X77
& rS(X74,X75,X76) )
=> ~ ron(X74,X76) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))') ).
fof('neg(neg(319))',axiom,
~ rR(vd1185,vd1201,vd1187),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','neg(neg(319))') ).
fof('neg(neg(270))',axiom,
~ ron(vd1187,vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','neg(neg(270))') ).
fof('holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)',axiom,
rS(vd1201,vd1187,vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)') ).
fof('pred(269, 0)',axiom,
rline(vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(269, 0)') ).
fof('pred(s3(plural(274)), 0)',axiom,
ron(vd1185,vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s3(plural(274)), 0)') ).
fof(c_0_16,plain,
! [X1,X2,X3,X4,X5] :
( ( ? [X8] :
( rpoint(X8)
& X1 = X8 )
& ? [X7] :
( rpoint(X7)
& X2 = X7 )
& ? [X6] :
( rpoint(X6)
& X3 = X6 )
& X1 != X2
& X1 != X3
& X2 != X3
& rline(X5)
& ron(X1,X4)
& ron(X2,X4)
& ron(X3,X4)
& X4 = X5 )
=> ( rR(X3,X1,X2)
| rR(X1,X2,X3)
| rR(X2,X1,X3) ) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(91), 0), imp(cond(axiom(91), 0)))']) ).
fof(c_0_17,plain,
( ? [X16] :
( rpoint(X16)
& vd1178 = X16 )
& ? [X15] :
( rpoint(X15)
& vd1179 = X15 )
& ? [X14] :
( rpoint(X14)
& vd1180 = X14 )
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& ? [X13] :
( rpoint(X13)
& vd1185 = X13 )
& ? [X12] :
( rpoint(X12)
& vd1186 = X12 )
& ? [X11] :
( rpoint(X11)
& vd1187 = X11 )
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ~ ? [X10] :
( rline(X10)
& ron(vd1185,X10)
& ron(vd1186,X10)
& ron(vd1187,X10) ) ),
inference(fof_simplification,[status(thm)],['and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))']) ).
fof(c_0_18,plain,
! [X755,X756,X757,X758,X759,X760,X761,X762] :
( rR(X757,X755,X756)
| rR(X755,X756,X757)
| rR(X756,X755,X757)
| ~ rpoint(X762)
| X755 != X762
| ~ rpoint(X761)
| X756 != X761
| ~ rpoint(X760)
| X757 != X760
| X755 = X756
| X755 = X757
| X756 = X757
| ~ rline(X759)
| ~ ron(X755,X758)
| ~ ron(X756,X758)
| ~ ron(X757,X758)
| X758 != X759 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_19,plain,
! [X764] :
( rpoint(esk7_0)
& vd1178 = esk7_0
& rpoint(esk6_0)
& vd1179 = esk6_0
& rpoint(esk5_0)
& vd1180 = esk5_0
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& rpoint(esk4_0)
& vd1185 = esk4_0
& rpoint(esk3_0)
& vd1186 = esk3_0
& rpoint(esk2_0)
& vd1187 = esk2_0
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ( ~ rline(X764)
| ~ ron(vd1185,X764)
| ~ ron(vd1186,X764)
| ~ ron(vd1187,X764) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).
cnf(c_0_20,plain,
( ~ rpoint(X8)
| X5 != X8
| ~ rpoint(X7)
| X4 != X7
| ~ rpoint(X6)
| X3 != X6
| ~ rline(X2)
| ~ ron(X5,X1)
| ~ ron(X4,X1)
| ~ ron(X3,X1)
| X1 != X2
| rR(X3,X5,X4)
| rR(X5,X4,X3)
| rR(X4,X5,X3)
| X5 = X4
| X5 = X3
| X4 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
vd1187 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
( rpoint(esk1_0)
& vd1201 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).
fof(c_0_24,plain,
vd1201 != vd1187,
inference(fof_simplification,[status(thm)],['holds(320, 1251, 0)']) ).
fof(c_0_25,plain,
! [X276,X277,X278] :
( ( ? [X281] :
( rpoint(X281)
& X276 = X281 )
& ? [X280] :
( rpoint(X280)
& X277 = X280 )
& ? [X279] :
( rpoint(X279)
& X278 = X279 )
& rR(X277,X276,X278) )
=> ( rR(X277,X278,X276)
& X276 != X277
& X276 != X278
& ~ rR(X276,X277,X278) ) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(81), 0), imp(cond(axiom(81), 0)))']) ).
cnf(c_0_26,plain,
( ~ ron(X3,X4)
| ~ ron(X1,X4)
| ~ ron(X2,X4)
| ~ rline(X4)
| ~ rpoint(X3)
| ~ rpoint(X1)
| ~ rpoint(X2)
| rR(X3,X2,X1)
| rR(X1,X2,X3)
| rR(X2,X1,X3)
| X3 = X1
| X3 = X2
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_27,plain,
ron(vd1187,vd1232),
inference(split_conjunct,[status(thm)],['pred(s3(plural(315)), 0)']) ).
cnf(c_0_28,plain,
rpoint(vd1187),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
rline(vd1232),
inference(split_conjunct,[status(thm)],['pred(293, 0)']) ).
cnf(c_0_30,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
vd1201 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
vd1201 != vd1187,
inference(fof_nnf,[status(thm)],[c_0_24]) ).
fof(c_0_33,plain,
! [X1060,X1061,X1062,X1063,X1064,X1065] :
( ( ~ rpoint(X1065)
| X1060 != X1065
| ~ rpoint(X1064)
| X1061 != X1064
| ~ rpoint(X1063)
| X1062 != X1063
| ~ rR(X1061,X1060,X1062)
| rR(X1061,X1062,X1060) )
& ( ~ rpoint(X1065)
| X1060 != X1065
| ~ rpoint(X1064)
| X1061 != X1064
| ~ rpoint(X1063)
| X1062 != X1063
| ~ rR(X1061,X1060,X1062)
| X1060 != X1061 )
& ( ~ rpoint(X1065)
| X1060 != X1065
| ~ rpoint(X1064)
| X1061 != X1064
| ~ rpoint(X1063)
| X1062 != X1063
| ~ rR(X1061,X1060,X1062)
| X1060 != X1062 )
& ( ~ rpoint(X1065)
| X1060 != X1065
| ~ rpoint(X1064)
| X1061 != X1064
| ~ rpoint(X1063)
| X1062 != X1063
| ~ rR(X1061,X1060,X1062)
| ~ rR(X1060,X1061,X1062) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])]) ).
cnf(c_0_34,plain,
( ~ ron(X1,vd1232)
| ~ ron(X2,vd1232)
| ~ rpoint(X1)
| ~ rpoint(X2)
| rR(vd1187,X2,X1)
| rR(X2,vd1187,X1)
| rR(X1,vd1187,X2)
| X1 = X2
| X2 = vd1187
| X1 = vd1187 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_35,plain,
ron(vd1201,vd1232),
inference(split_conjunct,[status(thm)],['pred(s2(plural(315)), 0)']) ).
cnf(c_0_36,plain,
rpoint(vd1201),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
vd1201 != vd1187,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_39,plain,
vd1185 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_40,negated_conjecture,
~ ( rR(vd1187,vd1185,vd1201)
| rR(vd1201,vd1185,vd1187) ),
inference(assume_negation,[status(cth)],['dis(321)']) ).
cnf(c_0_41,plain,
( ~ rpoint(X6)
| X3 != X6
| ~ rpoint(X5)
| X1 != X5
| ~ rpoint(X4)
| X2 != X4
| ~ rR(X1,X3,X2)
| rR(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( ~ ron(X1,vd1232)
| ~ rpoint(X1)
| rR(X1,vd1187,vd1201)
| rR(vd1201,vd1187,X1)
| rR(vd1187,vd1201,X1)
| X1 = vd1187
| X1 = vd1201 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_37]) ).
cnf(c_0_43,plain,
ron(vd1185,vd1232),
inference(split_conjunct,[status(thm)],['pred(s1(plural(315)), 0)']) ).
cnf(c_0_44,plain,
rpoint(vd1185),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_45,negated_conjecture,
( ~ rR(vd1187,vd1185,vd1201)
& ~ rR(vd1201,vd1185,vd1187) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])]) ).
fof(c_0_46,plain,
! [X74,X75,X76,X77] :
( ( ? [X79] :
( rpoint(X79)
& X74 = X79 )
& ? [X78] :
( rpoint(X78)
& X75 = X78 )
& rline(X77)
& X76 = X77
& rS(X74,X75,X76) )
=> ~ ron(X74,X76) ),
inference(fof_simplification,[status(thm)],['qu(cond(axiom(99), 0), imp(cond(axiom(99), 0)))']) ).
cnf(c_0_47,plain,
( ~ rR(X1,X3,X2)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X3)
| rR(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_41])])]) ).
cnf(c_0_48,plain,
( rR(vd1187,vd1201,vd1185)
| rR(vd1201,vd1187,vd1185)
| rR(vd1185,vd1187,vd1201)
| vd1201 = vd1185
| vd1187 = vd1185 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
~ rR(vd1187,vd1185,vd1201),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_50,plain,
~ rR(vd1185,vd1201,vd1187),
inference(fof_simplification,[status(thm)],['neg(neg(319))']) ).
fof(c_0_51,plain,
! [X844,X845,X846,X847,X848,X849] :
( ~ ron(X844,X846)
| ~ rpoint(X849)
| X844 != X849
| ~ rpoint(X848)
| X845 != X848
| ~ rline(X847)
| X846 != X847
| ~ rS(X844,X845,X846) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])]) ).
fof(c_0_52,plain,
~ ron(vd1187,vd1197),
inference(fof_simplification,[status(thm)],['neg(neg(270))']) ).
cnf(c_0_53,plain,
( rR(vd1185,vd1187,vd1201)
| rR(vd1201,vd1187,vd1185)
| vd1187 = vd1185
| vd1201 = vd1185 ),
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_47,c_0_48]),c_0_36]),c_0_28]),c_0_44])]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
~ rR(vd1201,vd1185,vd1187),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_55,plain,
~ rR(vd1185,vd1201,vd1187),
inference(fof_nnf,[status(thm)],[c_0_50]) ).
cnf(c_0_56,plain,
( ~ ron(X1,X3)
| ~ rpoint(X6)
| X1 != X6
| ~ rpoint(X5)
| X2 != X5
| ~ rline(X4)
| X3 != X4
| ~ rS(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_57,plain,
~ ron(vd1187,vd1197),
inference(fof_nnf,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
( rR(vd1185,vd1187,vd1201)
| vd1201 = vd1185
| vd1187 = vd1185 ),
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_47,c_0_53]),c_0_28]),c_0_36]),c_0_44])]),c_0_54]) ).
cnf(c_0_59,plain,
~ rR(vd1185,vd1201,vd1187),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,plain,
( ~ ron(X1,X3)
| ~ rline(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rS(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_56])])]) ).
cnf(c_0_61,plain,
rS(vd1201,vd1187,vd1197),
inference(split_conjunct,[status(thm)],['holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)']) ).
cnf(c_0_62,plain,
rline(vd1197),
inference(split_conjunct,[status(thm)],['pred(269, 0)']) ).
cnf(c_0_63,plain,
~ ron(vd1187,vd1197),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_64,plain,
( vd1187 = vd1185
| vd1201 = vd1185 ),
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_47,c_0_58]),c_0_28]),c_0_44]),c_0_36])]),c_0_59]) ).
cnf(c_0_65,plain,
ron(vd1185,vd1197),
inference(split_conjunct,[status(thm)],['pred(s3(plural(274)), 0)']) ).
cnf(c_0_66,plain,
~ ron(vd1201,vd1197),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_36]),c_0_28]),c_0_62])]) ).
cnf(c_0_67,plain,
vd1201 = vd1185,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_65])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO298+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 15:15:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.75/2.35 % Version: 3.5.1
% 12.75/2.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 12.75/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.75/2.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.75/2.35 % Starting new_bool_3 with 300s (1) cores
% 12.75/2.35 % Starting new_bool_1 with 300s (1) cores
% 12.75/2.35 % Starting sh5l with 300s (1) cores
% 12.75/2.35 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1278906 completed with status 0
% 12.75/2.35 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 12.75/2.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 12.75/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.75/2.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.75/2.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.75/2.35 % No SInE strategy applied
% 12.75/2.35 % Search class: FGHSF-FSLM33-SFFFFFNN
% 12.75/2.35 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 12.75/2.35 % Starting SubtermCWHack with 136s (1) cores
% 12.75/2.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 12.75/2.35 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 12.75/2.35 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 12.75/2.35 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 12.75/2.35 % G-E--_302_C18_F1_URBAN_S0Y with pid 1278914 completed with status 0
% 12.75/2.35 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 12.75/2.35 % Preprocessing class: FSLSSMSMSSSNFFN.
% 12.75/2.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.75/2.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 12.75/2.35 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.75/2.35 % No SInE strategy applied
% 12.75/2.35 % Search class: FGHSF-FSLM33-SFFFFFNN
% 12.75/2.35 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 12.75/2.35 % Starting SubtermCWHack with 136s (1) cores
% 12.75/2.35 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 12.75/2.35 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 12.75/2.35 % Preprocessing time : 0.018 s
% 12.75/2.35
% 12.75/2.35 % Proof found!
% 12.75/2.35 % SZS status Theorem
% 12.75/2.35 % SZS output start CNFRefutation
% See solution above
% 12.75/2.35 % Parsed axioms : 158
% 12.75/2.35 % Removed by relevancy pruning/SinE : 0
% 12.75/2.35 % Initial clauses : 326
% 12.75/2.35 % Removed in clause preprocessing : 2
% 12.75/2.35 % Initial clauses in saturation : 324
% 12.75/2.35 % Processed clauses : 1892
% 12.75/2.35 % ...of these trivial : 52
% 12.75/2.35 % ...subsumed : 592
% 12.75/2.35 % ...remaining for further processing : 1248
% 12.75/2.35 % Other redundant clauses eliminated : 1112
% 12.75/2.35 % Clauses deleted for lack of memory : 0
% 12.75/2.35 % Backward-subsumed : 22
% 12.75/2.35 % Backward-rewritten : 197
% 12.75/2.35 % Generated clauses : 11268
% 12.75/2.35 % ...of the previous two non-redundant : 10862
% 12.75/2.35 % ...aggressively subsumed : 0
% 12.75/2.35 % Contextual simplify-reflections : 107
% 12.75/2.35 % Paramodulations : 11013
% 12.75/2.35 % Factorizations : 0
% 12.75/2.35 % NegExts : 0
% 12.75/2.35 % Equation resolutions : 1127
% 12.75/2.35 % Disequality decompositions : 0
% 12.75/2.35 % Total rewrite steps : 5511
% 12.75/2.35 % ...of those cached : 5447
% 12.75/2.35 % Propositional unsat checks : 0
% 12.75/2.35 % Propositional check models : 0
% 12.75/2.35 % Propositional check unsatisfiable : 0
% 12.75/2.35 % Propositional clauses : 0
% 12.75/2.35 % Propositional clauses after purity: 0
% 12.75/2.35 % Propositional unsat core size : 0
% 12.75/2.35 % Propositional preprocessing time : 0.000
% 12.75/2.35 % Propositional encoding time : 0.000
% 12.75/2.35 % Propositional solver time : 0.000
% 12.75/2.35 % Success case prop preproc time : 0.000
% 12.75/2.35 % Success case prop encoding time : 0.000
% 12.75/2.35 % Success case prop solver time : 0.000
% 12.75/2.35 % Current number of processed clauses : 789
% 12.75/2.35 % Positive orientable unit clauses : 49
% 12.75/2.35 % Positive unorientable unit clauses: 0
% 12.75/2.35 % Negative unit clauses : 11
% 12.75/2.35 % Non-unit-clauses : 729
% 12.75/2.35 % Current number of unprocessed clauses: 9045
% 12.75/2.35 % ...number of literals in the above : 139280
% 12.75/2.35 % Current number of archived formulas : 0
% 12.75/2.35 % Current number of archived clauses : 219
% 12.75/2.35 % Clause-clause subsumption calls (NU) : 599334
% 12.75/2.35 % Rec. Clause-clause subsumption calls : 22424
% 12.75/2.35 % Non-unit clause-clause subsumptions : 621
% 12.75/2.35 % Unit Clause-clause subsumption calls : 1160
% 12.75/2.35 % Rewrite failures with RHS unbound : 0
% 12.75/2.35 % BW rewrite match attempts : 8
% 12.75/2.35 % BW rewrite match successes : 8
% 12.75/2.35 % Condensation attempts : 0
% 12.75/2.35 % Condensation successes : 0
% 12.75/2.35 % Termbank termtop insertions : 465714
% 12.75/2.35 % Search garbage collected termcells : 14347
% 12.75/2.35
% 12.75/2.35 % -------------------------------------------------
% 12.75/2.35 % User time : 1.649 s
% 12.75/2.35 % System time : 0.042 s
% 12.75/2.35 % Total time : 1.691 s
% 12.75/2.35 % Maximum resident set size: 6296 pages
% 12.75/2.35
% 12.75/2.35 % -------------------------------------------------
% 12.75/2.35 % User time : 8.562 s
% 12.75/2.35 % System time : 0.215 s
% 12.75/2.35 % Total time : 8.777 s
% 12.75/2.35 % Maximum resident set size: 5632 pages
% 12.75/2.35 % E exiting
%------------------------------------------------------------------------------