%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO305+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 : n001.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:08 PM UTC 2026
% Result : Theorem 1.08s 0.58s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 22 unt; 0 def)
% Number of atoms : 104 ( 37 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 118 ( 45 ~; 32 |; 40 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 13 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof('and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))',axiom,
( ? [X3] :
( rpoint(X3)
& vd1287 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1288 = X2 )
& ? [X1] :
( rpoint(X1)
& vd1289 = X1 )
& vd1287 != vd1288
& vd1287 != vd1289
& vd1288 != vd1289
& vf(vd1287,vd1288) = vf(vd1287,vd1289) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))') ).
fof('qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))',axiom,
! [X4,X5,X6,X7,X8] :
( ( ? [X11] :
( rpoint(X11)
& X4 = X11 )
& ? [X10] :
( rpoint(X10)
& X5 = X10 )
& ? [X9] :
( rpoint(X9)
& X6 = X9 )
& rline(X8)
& rR(X5,X4,X6)
& ron(X4,X7)
& ron(X5,X7)
& X7 = X8 )
=> ron(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))') ).
fof('pred(conjunct2(349), 0)',conjecture,
ron(vd1302,vd1297),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(conjunct2(349), 0)') ).
fof('and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))',axiom,
( rR(vd1288,vd1287,vd1299)
& rpoint(vd1303)
& rR(vd1289,vd1287,vd1302)
& vd1302 = vd1303 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))') ).
fof('pred(347, 0)',axiom,
rline(vd1297),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(347, 0)') ).
fof('pred(s1(plural(347)), 0)',axiom,
ron(vd1287,vd1297),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s1(plural(347)), 0)') ).
fof('pred(s2(plural(347)), 0)',axiom,
ron(vd1289,vd1297),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s2(plural(347)), 0)') ).
fof(c_0_7,plain,
( ? [X3] :
( rpoint(X3)
& vd1287 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1288 = X2 )
& ? [X1] :
( rpoint(X1)
& vd1289 = X1 )
& vd1287 != vd1288
& vd1287 != vd1289
& vd1288 != vd1289
& vf(vd1287,vd1288) = vf(vd1287,vd1289) ),
inference(fof_simplification,[status(thm)],['and(holds(conjunct2(345), 1294, 0), and(pred(conjunct1(345), 9), and(pred(conjunct1(345), 8), and(pred(conjunct1(345), 7), and(qe(s3(plural(345))), and(qe(s2(plural(345))), qe(s1(plural(345)))))))))']) ).
fof(c_0_8,plain,
! [X764,X765,X766,X767,X768,X769,X770,X771] :
( ron(X766,X767)
| ~ rpoint(X771)
| X764 != X771
| ~ rpoint(X770)
| X765 != X770
| ~ rpoint(X769)
| X766 != X769
| ~ rline(X768)
| ~ rR(X765,X764,X766)
| ~ ron(X764,X767)
| ~ ron(X765,X767)
| X767 != X768 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(83), 0), imp(cond(axiom(83), 0)))'])])])]) ).
fof(c_0_9,plain,
( rpoint(esk3_0)
& vd1287 = esk3_0
& rpoint(esk2_0)
& vd1288 = esk2_0
& rpoint(esk1_0)
& vd1289 = esk1_0
& vd1287 != vd1288
& vd1287 != vd1289
& vd1288 != vd1289
& vf(vd1287,vd1288) = vf(vd1287,vd1289) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,negated_conjecture,
~ ron(vd1302,vd1297),
inference(assume_negation,[status(cth)],['pred(conjunct2(349), 0)']) ).
cnf(c_0_11,plain,
( ~ rpoint(X8)
| X4 != X8
| ~ rpoint(X7)
| X3 != X7
| ~ rpoint(X6)
| X5 != X6
| ~ rline(X2)
| ~ rR(X3,X4,X5)
| ~ ron(X4,X1)
| ~ ron(X3,X1)
| X1 != X2
| ron(X5,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
rpoint(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
vd1287 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
rpoint(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
vd1289 = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
rpoint(vd1303),
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
cnf(c_0_17,plain,
vd1302 = vd1303,
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
fof(c_0_18,negated_conjecture,
~ ron(vd1302,vd1297),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( ~ ron(X4,X2)
| ~ ron(X3,X2)
| ~ rR(X4,X3,X1)
| ~ rpoint(X1)
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rline(X2)
| ron(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_20,plain,
rR(vd1289,vd1287,vd1302),
inference(split_conjunct,[status(thm)],['and(pred(conjunct2(348), 4), and(holds(conjunct2(348), 1304, 0), and(pred(conjunct2(348), 1), holds(conjunct1(348), 1301, 0))))']) ).
cnf(c_0_21,plain,
rpoint(vd1287),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_22,plain,
rpoint(vd1289),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
rpoint(vd1302),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_24,negated_conjecture,
~ ron(vd1302,vd1297),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( ~ ron(vd1289,X1)
| ~ ron(vd1287,X1)
| ~ rline(X1)
| ron(vd1302,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
rline(vd1297),
inference(split_conjunct,[status(thm)],['pred(347, 0)']) ).
cnf(c_0_27,plain,
ron(vd1287,vd1297),
inference(split_conjunct,[status(thm)],['pred(s1(plural(347)), 0)']) ).
cnf(c_0_28,plain,
ron(vd1289,vd1297),
inference(split_conjunct,[status(thm)],['pred(s2(plural(347)), 0)']) ).
cnf(c_0_29,negated_conjecture,
~ ron(vd1302,vd1297),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO305+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 15:24:12 UTC 2026
% 0.03/0.38 % CPUTime :
% 0.03/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.42 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
% 1.08/0.58 % Version: 3.5.1
% 1.08/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.58 % Starting new_bool_3 with 300s (1) cores
% 1.08/0.58 % Starting new_bool_1 with 300s (1) cores
% 1.08/0.58 % Starting sh5l with 300s (1) cores
% 1.08/0.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 890789 completed with status 0
% 1.08/0.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.08/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.08/0.58 % No SInE strategy applied
% 1.08/0.58 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.08/0.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.08/0.58 % Starting SubtermCWHack with 136s (1) cores
% 1.08/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.08/0.58 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.08/0.58 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 1.08/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.08/0.58 % G-E--_302_C18_F1_URBAN_S0Y with pid 890815 completed with status 0
% 1.08/0.58 % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 1.08/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.08/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.08/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.08/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.08/0.58 % No SInE strategy applied
% 1.08/0.58 % Search class: FGHSF-FSLM33-SFFFFFNN
% 1.08/0.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.08/0.58 % Starting SubtermCWHack with 136s (1) cores
% 1.08/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.08/0.58 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.08/0.58 % Preprocessing time : 0.019 s
% 1.08/0.58
% 1.08/0.58 % Proof found!
% 1.08/0.58 % SZS status Theorem
% 1.08/0.58 % SZS output start CNFRefutation
% See solution above
% 1.08/0.58 % Parsed axioms : 125
% 1.08/0.58 % Removed by relevancy pruning/SinE : 0
% 1.08/0.58 % Initial clauses : 292
% 1.08/0.58 % Removed in clause preprocessing : 2
% 1.08/0.58 % Initial clauses in saturation : 290
% 1.08/0.58 % Processed clauses : 409
% 1.08/0.58 % ...of these trivial : 0
% 1.08/0.58 % ...subsumed : 4
% 1.08/0.58 % ...remaining for further processing : 405
% 1.08/0.58 % Other redundant clauses eliminated : 1184
% 1.08/0.58 % Clauses deleted for lack of memory : 0
% 1.08/0.58 % Backward-subsumed : 0
% 1.08/0.58 % Backward-rewritten : 1
% 1.08/0.58 % Generated clauses : 419
% 1.08/0.58 % ...of the previous two non-redundant : 403
% 1.08/0.58 % ...aggressively subsumed : 0
% 1.08/0.58 % Contextual simplify-reflections : 9
% 1.08/0.58 % Paramodulations : 158
% 1.08/0.58 % Factorizations : 0
% 1.08/0.58 % NegExts : 0
% 1.08/0.58 % Equation resolutions : 1193
% 1.08/0.58 % Disequality decompositions : 0
% 1.08/0.58 % Total rewrite steps : 157
% 1.08/0.58 % ...of those cached : 136
% 1.08/0.58 % Propositional unsat checks : 0
% 1.08/0.58 % Propositional check models : 0
% 1.08/0.58 % Propositional check unsatisfiable : 0
% 1.08/0.58 % Propositional clauses : 0
% 1.08/0.58 % Propositional clauses after purity: 0
% 1.08/0.58 % Propositional unsat core size : 0
% 1.08/0.58 % Propositional preprocessing time : 0.000
% 1.08/0.58 % Propositional encoding time : 0.000
% 1.08/0.58 % Propositional solver time : 0.000
% 1.08/0.58 % Success case prop preproc time : 0.000
% 1.08/0.58 % Success case prop encoding time : 0.000
% 1.08/0.58 % Success case prop solver time : 0.000
% 1.08/0.58 % Current number of processed clauses : 152
% 1.08/0.58 % Positive orientable unit clauses : 26
% 1.08/0.58 % Positive unorientable unit clauses: 0
% 1.08/0.58 % Negative unit clauses : 12
% 1.08/0.58 % Non-unit-clauses : 114
% 1.08/0.58 % Current number of unprocessed clauses: 280
% 1.08/0.58 % ...number of literals in the above : 2520
% 1.08/0.58 % Current number of archived formulas : 0
% 1.08/0.58 % Current number of archived clauses : 1
% 1.08/0.58 % Clause-clause subsumption calls (NU) : 7452
% 1.08/0.58 % Rec. Clause-clause subsumption calls : 661
% 1.08/0.58 % Non-unit clause-clause subsumptions : 12
% 1.08/0.58 % Unit Clause-clause subsumption calls : 82
% 1.08/0.58 % Rewrite failures with RHS unbound : 0
% 1.08/0.58 % BW rewrite match attempts : 1
% 1.08/0.58 % BW rewrite match successes : 1
% 1.08/0.58 % Condensation attempts : 0
% 1.08/0.58 % Condensation successes : 0
% 1.08/0.58 % Termbank termtop insertions : 70267
% 1.08/0.58 % Search garbage collected termcells : 15116
% 1.08/0.58
% 1.08/0.58 % -------------------------------------------------
% 1.08/0.58 % User time : 0.123 s
% 1.08/0.58 % System time : 0.010 s
% 1.08/0.58 % Total time : 0.133 s
% 1.08/0.58 % Maximum resident set size: 6032 pages
% 1.08/0.58
% 1.08/0.58 % -------------------------------------------------
% 1.08/0.58 % User time : 0.459 s
% 1.08/0.58 % System time : 0.038 s
% 1.08/0.58 % Total time : 0.497 s
% 1.08/0.58 % Maximum resident set size: 5632 pages
% 1.08/0.58 % E exiting
%------------------------------------------------------------------------------