%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO111-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:29:08 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 50 ( 10 unt; 5 nHn; 50 RR)
% Number of literals : 107 ( 18 equ; 58 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 129 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(part_of_defn_1,axiom,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',part_of_defn_1) ).
cnf(between_c_defn_2,axiom,
( ~ between_c(X1,X2,X3,X4)
| part_of(ax1_sk1(X4,X3,X2,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_2) ).
cnf(end_point_defn_13,axiom,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',end_point_defn_13) ).
cnf(between_c_defn_3,axiom,
( ~ between_c(X1,X2,X3,X4)
| end_point(X2,ax1_sk1(X4,X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_3) ).
cnf(inner_point_defn_21,axiom,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',inner_point_defn_21) ).
cnf(between_c_defn_5,axiom,
( ~ between_c(X1,X2,X3,X4)
| inner_point(X3,ax1_sk1(X4,X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_5) ).
cnf(between_c_defn_4,axiom,
( ~ between_c(X1,X2,X3,X4)
| end_point(X4,ax1_sk1(X4,X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_4) ).
cnf(inner_point_defn_22,axiom,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-0.ax',inner_point_defn_22) ).
cnf(theorem_3_8_1_78,negated_conjecture,
( ~ incident_c(sk18,sk15)
| ~ incident_c(sk17,sk15)
| ~ incident_c(sk16,sk15)
| sk16 = sk18
| sk17 = sk18
| sk16 = sk17 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_3_8_1_78) ).
cnf(theorem_3_8_1_77,negated_conjecture,
between_c(sk15,sk16,sk17,sk18),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_3_8_1_77) ).
cnf(between_c_defn_1,axiom,
( X2 != X4
| ~ between_c(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004-1.ax',between_c_defn_1) ).
cnf(c_0_11,plain,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
inference(fof_simplification,[status(thm)],[part_of_defn_1]) ).
cnf(c_0_12,plain,
( ~ between_c(X1,X2,X3,X4)
| part_of(ax1_sk1(X4,X3,X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[between_c_defn_2]) ).
cnf(c_0_13,plain,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
inference(fof_simplification,[status(thm)],[end_point_defn_13]) ).
cnf(c_0_14,plain,
( ~ between_c(X1,X2,X3,X4)
| end_point(X2,ax1_sk1(X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[between_c_defn_3]) ).
cnf(c_0_15,plain,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
inference(fof_simplification,[status(thm)],[inner_point_defn_21]) ).
cnf(c_0_16,plain,
( ~ between_c(X1,X2,X3,X4)
| inner_point(X3,ax1_sk1(X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[between_c_defn_5]) ).
cnf(c_0_17,plain,
( ~ between_c(X1,X2,X3,X4)
| end_point(X4,ax1_sk1(X4,X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[between_c_defn_4]) ).
cnf(c_0_18,plain,
( ~ incident_c(X3,X1)
| ~ part_of(X1,X2)
| incident_c(X3,X2) ),
c_0_11 ).
cnf(c_0_19,plain,
( ~ between_c(X1,X2,X3,X4)
| part_of(ax1_sk1(X4,X3,X2,X1),X1) ),
c_0_12 ).
cnf(c_0_20,plain,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
c_0_13 ).
cnf(c_0_21,plain,
( ~ between_c(X1,X2,X3,X4)
| end_point(X2,ax1_sk1(X4,X3,X2,X1)) ),
c_0_14 ).
cnf(c_0_22,plain,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
c_0_15 ).
cnf(c_0_23,plain,
( ~ between_c(X1,X2,X3,X4)
| inner_point(X3,ax1_sk1(X4,X3,X2,X1)) ),
c_0_16 ).
cnf(c_0_24,plain,
( ~ between_c(X1,X2,X3,X4)
| end_point(X4,ax1_sk1(X4,X3,X2,X1)) ),
c_0_17 ).
cnf(c_0_25,plain,
( ~ incident_c(X1,ax1_sk1(X5,X4,X3,X2))
| ~ between_c(X2,X3,X4,X5)
| incident_c(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ between_c(X4,X1,X3,X2)
| incident_c(X1,ax1_sk1(X2,X3,X1,X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ between_c(X4,X3,X1,X2)
| incident_c(X1,ax1_sk1(X2,X1,X3,X4)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ between_c(X4,X3,X2,X1)
| incident_c(X1,ax1_sk1(X1,X2,X3,X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_29,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
inference(fof_simplification,[status(thm)],[inner_point_defn_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ incident_c(sk18,sk15)
| ~ incident_c(sk17,sk15)
| ~ incident_c(sk16,sk15)
| sk16 = sk18
| sk17 = sk18
| sk16 = sk17 ),
inference(fof_simplification,[status(thm)],[theorem_3_8_1_78]) ).
cnf(c_0_31,plain,
( ~ between_c(X2,X1,X3,X4)
| incident_c(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
between_c(sk15,sk16,sk17,sk18),
theorem_3_8_1_77 ).
cnf(c_0_33,plain,
( ~ between_c(X2,X3,X1,X4)
| incident_c(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_34,plain,
( ~ between_c(X2,X3,X4,X1)
| incident_c(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_35,plain,
( ~ end_point(X1,X2)
| ~ inner_point(X1,X2) ),
c_0_29 ).
cnf(c_0_36,negated_conjecture,
( ~ incident_c(sk18,sk15)
| ~ incident_c(sk17,sk15)
| ~ incident_c(sk16,sk15)
| sk16 = sk18
| sk17 = sk18
| sk16 = sk17 ),
c_0_30 ).
cnf(c_0_37,negated_conjecture,
incident_c(sk16,sk15),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
incident_c(sk17,sk15),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
incident_c(sk18,sk15),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_40,plain,
( ~ end_point(X3,ax1_sk1(X4,X3,X2,X1))
| ~ between_c(X1,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_41,plain,
( X2 != X4
| ~ between_c(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[between_c_defn_1]) ).
cnf(c_0_42,negated_conjecture,
( sk18 = sk17
| sk18 = sk16
| sk17 = sk16 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),c_0_38]),c_0_39])]) ).
cnf(c_0_43,plain,
~ between_c(X1,X2,X3,X3),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_44,plain,
( X2 != X4
| ~ between_c(X1,X2,X3,X4) ),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
( sk17 = sk16
| sk18 = sk16 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_42]),c_0_43]) ).
cnf(c_0_46,plain,
~ between_c(X1,X2,X3,X2),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_47,negated_conjecture,
sk17 = sk16,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_45]),c_0_46]) ).
cnf(c_0_48,plain,
~ between_c(X1,X2,X2,X3),
inference(spm,[status(thm)],[c_0_40,c_0_21]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO111-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n020.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 11:26:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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
% 0.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % sh5l with pid 404937 completed with status 0
% 0.14/0.43 % Result found by sh5l
% 0.14/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 404944 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.43 % Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.43 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % Preprocessing time : 0.002 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 56
% 0.14/0.43 % Removed by relevancy pruning/SinE : 10
% 0.14/0.43 % Initial clauses : 46
% 0.14/0.43 % Removed in clause preprocessing : 3
% 0.14/0.43 % Initial clauses in saturation : 43
% 0.14/0.43 % Processed clauses : 80
% 0.14/0.43 % ...of these trivial : 0
% 0.14/0.43 % ...subsumed : 5
% 0.14/0.43 % ...remaining for further processing : 75
% 0.14/0.43 % Other redundant clauses eliminated : 5
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 1
% 0.14/0.43 % Backward-rewritten : 4
% 0.14/0.43 % Generated clauses : 101
% 0.14/0.43 % ...of the previous two non-redundant : 90
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 95
% 0.14/0.43 % Factorizations : 1
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 5
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 9
% 0.14/0.43 % ...of those cached : 5
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 65
% 0.14/0.43 % Positive orientable unit clauses : 3
% 0.14/0.43 % Positive unorientable unit clauses: 0
% 0.14/0.43 % Negative unit clauses : 3
% 0.14/0.43 % Non-unit-clauses : 59
% 0.14/0.43 % Current number of unprocessed clauses: 53
% 0.14/0.43 % ...number of literals in the above : 244
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 5
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 1058
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 666
% 0.14/0.43 % Non-unit clause-clause subsumptions : 6
% 0.14/0.43 % Unit Clause-clause subsumption calls : 24
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 2
% 0.14/0.43 % BW rewrite match successes : 2
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 3160
% 0.14/0.43 % Search garbage collected termcells : 177
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.007 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.011 s
% 0.14/0.43 % Maximum resident set size: 3684 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.010 s
% 0.14/0.43 % System time : 0.008 s
% 0.14/0.43 % Total time : 0.018 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------