%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO300+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:30:02 PM UTC 2026
% Result : Theorem 1.66s 0.69s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 23 unt; 0 def)
% Number of atoms : 125 ( 66 equ)
% Maximal formula atoms : 22 ( 3 avg)
% Number of connectives : 132 ( 40 ~; 23 |; 68 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 15 con; 0-3 aty)
% Number of variables : 38 ( 0 sgn 10 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(331, 1260, 0)',conjecture,
vf(vd1185,vd1201) = vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(331, 1260, 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,
( ? [X14] :
( rpoint(X14)
& vd1178 = X14 )
& ? [X13] :
( rpoint(X13)
& vd1179 = X13 )
& ? [X12] :
( rpoint(X12)
& vd1180 = X12 )
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& ? [X11] :
( rpoint(X11)
& vd1185 = X11 )
& ? [X10] :
( rpoint(X10)
& vd1186 = X10 )
& ? [X9] :
( rpoint(X9)
& vd1187 = X9 )
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ~ ? [X8] :
( rline(X8)
& ron(vd1185,X8)
& ron(vd1186,X8)
& ron(vd1187,X8) ) ),
file('/export/starexec/sandbox2/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('qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))',axiom,
! [X1,X2,X3] :
( ( ? [X6] :
( rpoint(X6)
& X1 = X6 )
& ? [X5] :
( rpoint(X5)
& X2 = X5 )
& ? [X4] :
( rpoint(X4)
& X3 = X4 )
& rR(X2,X1,X3) )
=> vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))') ).
fof('holds(314, 1247, 0)',axiom,
vf(vd1199,vd1201) = vf(vd1185,vd1187),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(314, 1247, 0)') ).
fof('holds(291, 1230, 0)',axiom,
vd1199 = vd1185,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(291, 1230, 0)') ).
fof('qe(s3(plural(271)))',axiom,
? [X7] :
( rpoint(X7)
& vd1201 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(271)))') ).
fof('holds(330, 1259, 0)',axiom,
rR(vd1187,vd1185,vd1201),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(330, 1259, 0)') ).
fof(c_0_7,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(assume_negation,[status(cth)],['holds(331, 1260, 0)']) ).
fof(c_0_8,plain,
( ? [X14] :
( rpoint(X14)
& vd1178 = X14 )
& ? [X13] :
( rpoint(X13)
& vd1179 = X13 )
& ? [X12] :
( rpoint(X12)
& vd1180 = X12 )
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& ? [X11] :
( rpoint(X11)
& vd1185 = X11 )
& ? [X10] :
( rpoint(X10)
& vd1186 = X10 )
& ? [X9] :
( rpoint(X9)
& vd1187 = X9 )
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ~ ? [X8] :
( rline(X8)
& ron(vd1185,X8)
& ron(vd1186,X8)
& ron(vd1187,X8) ) ),
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_9,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X755,X756,X757,X758,X759,X760] :
( vplus(vf(X755,X756),vf(X756,X757)) = vf(X755,X757)
| ~ rpoint(X760)
| X755 != X760
| ~ rpoint(X759)
| X756 != X759
| ~ rpoint(X758)
| X757 != X758
| ~ rR(X756,X755,X757) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))'])])])]) ).
fof(c_0_11,plain,
! [X762] :
( 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(X762)
| ~ ron(vd1185,X762)
| ~ ron(vd1186,X762)
| ~ ron(vd1187,X762) ) ),
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_8])])])])]) ).
fof(c_0_12,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
vf(vd1199,vd1201) = vf(vd1185,vd1187),
inference(split_conjunct,[status(thm)],['holds(314, 1247, 0)']) ).
cnf(c_0_14,plain,
vd1199 = vd1185,
inference(split_conjunct,[status(thm)],['holds(291, 1230, 0)']) ).
cnf(c_0_15,plain,
( ~ rpoint(X6)
| X2 != X6
| ~ rpoint(X5)
| X1 != X5
| ~ rpoint(X4)
| X3 != X4
| ~ rR(X1,X2,X3)
| vplus(vf(X2,X1),vf(X1,X3)) = vf(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
rpoint(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
vd1185 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
rpoint(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
vd1187 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
( rpoint(esk1_0)
& vd1201 = esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],['qe(s3(plural(271)))'])]) ).
cnf(c_0_21,negated_conjecture,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
vf(vd1185,vd1187) = vf(vd1185,vd1201),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( ~ rR(X2,X1,X3)
| ~ rpoint(X3)
| ~ rpoint(X2)
| ~ rpoint(X1)
| vplus(vf(X1,X2),vf(X2,X3)) = vf(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])])]) ).
cnf(c_0_24,plain,
rpoint(vd1185),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
rpoint(vd1187),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
vd1201 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
vplus(vf(vd1185,vd1201),vf(vd1187,vd1201)) != vf(vd1185,vd1201),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ rR(vd1187,vd1185,X1)
| ~ rpoint(X1)
| vplus(vf(vd1185,vd1201),vf(vd1187,X1)) = vf(vd1185,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
rpoint(vd1201),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
rR(vd1187,vd1185,vd1201),
inference(split_conjunct,[status(thm)],['holds(330, 1259, 0)']) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO300+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 20 15:15:42 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.66/0.69 % Version: 3.5.1
% 1.66/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.66/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.66/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.66/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.66/0.69 % Starting sh5l with 300s (1) cores
% 1.66/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3708438 completed with status 0
% 1.66/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.66/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.66/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.66/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.66/0.69 % No SInE strategy applied
% 1.66/0.69 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.66/0.69 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.66/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.66/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.66/0.69 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.66/0.69 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.66/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.66/0.69 % G-E--_302_C18_F1_URBAN_S0Y with pid 3708457 completed with status 0
% 1.66/0.69 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 1.66/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.66/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.66/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.66/0.69 % No SInE strategy applied
% 1.66/0.69 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.66/0.69 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.66/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.66/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.66/0.69 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.66/0.69 % Preprocessing time : 0.019 s
% 1.66/0.69
% 1.66/0.69 % Proof found!
% 1.66/0.69 % SZS status Theorem
% 1.66/0.69 % SZS output start CNFRefutation
% See solution above
% 1.66/0.69 % Parsed axioms : 161
% 1.66/0.69 % Removed by relevancy pruning/SinE : 0
% 1.66/0.69 % Initial clauses : 328
% 1.66/0.69 % Removed in clause preprocessing : 2
% 1.66/0.69 % Initial clauses in saturation : 326
% 1.66/0.69 % Processed clauses : 851
% 1.66/0.69 % ...of these trivial : 28
% 1.66/0.69 % ...subsumed : 182
% 1.66/0.69 % ...remaining for further processing : 641
% 1.66/0.69 % Other redundant clauses eliminated : 1112
% 1.66/0.69 % Clauses deleted for lack of memory : 0
% 1.66/0.69 % Backward-subsumed : 11
% 1.66/0.69 % Backward-rewritten : 9
% 1.66/0.69 % Generated clauses : 2853
% 1.66/0.69 % ...of the previous two non-redundant : 2742
% 1.66/0.69 % ...aggressively subsumed : 0
% 1.66/0.69 % Contextual simplify-reflections : 33
% 1.66/0.69 % Paramodulations : 2600
% 1.66/0.69 % Factorizations : 0
% 1.66/0.69 % NegExts : 0
% 1.66/0.69 % Equation resolutions : 1125
% 1.66/0.69 % Disequality decompositions : 0
% 1.66/0.69 % Total rewrite steps : 3043
% 1.66/0.69 % ...of those cached : 2993
% 1.66/0.69 % Propositional unsat checks : 0
% 1.66/0.69 % Propositional check models : 0
% 1.66/0.69 % Propositional check unsatisfiable : 0
% 1.66/0.69 % Propositional clauses : 0
% 1.66/0.69 % Propositional clauses after purity: 0
% 1.66/0.69 % Propositional unsat core size : 0
% 1.66/0.69 % Propositional preprocessing time : 0.000
% 1.66/0.69 % Propositional encoding time : 0.000
% 1.66/0.69 % Propositional solver time : 0.000
% 1.66/0.69 % Success case prop preproc time : 0.000
% 1.66/0.69 % Success case prop encoding time : 0.000
% 1.66/0.69 % Success case prop solver time : 0.000
% 1.66/0.69 % Current number of processed clauses : 381
% 1.66/0.69 % Positive orientable unit clauses : 54
% 1.66/0.69 % Positive unorientable unit clauses: 0
% 1.66/0.69 % Negative unit clauses : 26
% 1.66/0.69 % Non-unit-clauses : 301
% 1.66/0.69 % Current number of unprocessed clauses: 2160
% 1.66/0.69 % ...number of literals in the above : 16164
% 1.66/0.69 % Current number of archived formulas : 0
% 1.66/0.69 % Current number of archived clauses : 20
% 1.66/0.69 % Clause-clause subsumption calls (NU) : 39662
% 1.66/0.69 % Rec. Clause-clause subsumption calls : 3157
% 1.66/0.69 % Non-unit clause-clause subsumptions : 151
% 1.66/0.69 % Unit Clause-clause subsumption calls : 361
% 1.66/0.69 % Rewrite failures with RHS unbound : 0
% 1.66/0.69 % BW rewrite match attempts : 7
% 1.66/0.69 % BW rewrite match successes : 7
% 1.66/0.69 % Condensation attempts : 0
% 1.66/0.69 % Condensation successes : 0
% 1.66/0.69 % Termbank termtop insertions : 133717
% 1.66/0.69 % Search garbage collected termcells : 14389
% 1.66/0.69
% 1.66/0.69 % -------------------------------------------------
% 1.66/0.69 % User time : 0.221 s
% 1.66/0.69 % System time : 0.015 s
% 1.66/0.69 % Total time : 0.236 s
% 1.66/0.69 % Maximum resident set size: 6300 pages
% 1.66/0.69
% 1.66/0.69 % -------------------------------------------------
% 1.66/0.69 % User time : 0.963 s
% 1.66/0.69 % System time : 0.046 s
% 1.66/0.69 % Total time : 1.009 s
% 1.66/0.69 % Maximum resident set size: 5632 pages
% 1.66/0.69 % E exiting
%------------------------------------------------------------------------------