%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO039-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:26:58 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 17 unt; 0 nHn; 17 RR)
% Number of literals : 29 ( 10 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 36 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
( ~ between(X1,X2,X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_betweeness) ).
cnf(w_between_u_and_x,hypothesis,
between(u,w,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',w_between_u_and_x) ).
cnf(u_is_x,hypothesis,
u = x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_is_x) ).
cnf(identity_for_equidistance,axiom,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
cnf(prove_corollary,negated_conjecture,
~ between(v,w,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(c_0_7,plain,
( ~ between(X1,X2,X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).
cnf(c_0_8,hypothesis,
between(u,w,x),
w_between_u_and_x ).
cnf(c_0_9,hypothesis,
u = x,
u_is_x ).
cnf(c_0_10,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).
cnf(c_0_11,negated_conjecture,
~ between(v,w,x),
inference(fof_simplification,[status(thm)],[prove_corollary]) ).
cnf(c_0_12,plain,
( ~ between(X1,X2,X1)
| X1 = X2 ),
c_0_7 ).
cnf(c_0_13,hypothesis,
between(x,w,x),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ equidistant(X1,X2,X3,X3)
| X1 = X2 ),
c_0_10 ).
cnf(c_0_15,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_16,negated_conjecture,
~ between(v,w,x),
c_0_11 ).
cnf(c_0_17,hypothesis,
w = x,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_19,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
~ between(v,x,x),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO039-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 % Computer : n007.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 20 08:31:50 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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
% 0.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % sh5l with pid 2678780 completed with status 0
% 0.13/0.45 % Result found by sh5l
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGUSS-FFSF33-SFFFFFNN
% 0.13/0.45 % partial match(1): FGUSS-FFMF33-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 2678782 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGUSS-FFSF33-SFFFFFNN
% 0.13/0.45 % partial match(1): FGUSS-FFMF33-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 21
% 0.13/0.45 % Removed by relevancy pruning/SinE : 8
% 0.13/0.45 % Initial clauses : 13
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 13
% 0.13/0.45 % Processed clauses : 13
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 0
% 0.13/0.45 % ...remaining for further processing : 13
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 4
% 0.13/0.45 % Generated clauses : 4
% 0.13/0.45 % ...of the previous two non-redundant : 6
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 4
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 5
% 0.13/0.45 % ...of those cached : 1
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 9
% 0.13/0.45 % Positive orientable unit clauses : 7
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 0
% 0.13/0.45 % Non-unit-clauses : 2
% 0.13/0.45 % Current number of unprocessed clauses: 6
% 0.13/0.45 % ...number of literals in the above : 29
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 4
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.45 % Non-unit clause-clause subsumptions : 0
% 0.13/0.45 % Unit Clause-clause subsumption calls : 0
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 10
% 0.13/0.45 % BW rewrite match successes : 3
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 501
% 0.13/0.45 % Search garbage collected termcells : 94
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.003 s
% 0.13/0.45 % System time : 0.002 s
% 0.13/0.45 % Total time : 0.004 s
% 0.13/0.45 % Maximum resident set size: 3656 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.003 s
% 0.13/0.45 % System time : 0.008 s
% 0.13/0.45 % Total time : 0.011 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------