%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO077-4 : 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 : n014.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:27:06 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.66s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 32 unt; 16 nHn; 49 RR)
% Number of literals : 167 ( 55 equ; 90 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_G10B,axiom,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X2,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO003-0.ax',axiom_G10B) ).
cnf(point2_not_point3,hypothesis,
point2 != point3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point2_not_point3) ).
cnf(point1_not_point3,hypothesis,
point1 != point3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point1_not_point3) ).
cnf(point1_not_point2,hypothesis,
point1 != point2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point1_not_point2) ).
cnf(axiom_G10D,axiom,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| line(line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO003-0.ax',axiom_G10D) ).
cnf(axiom_G1D,axiom,
( ~ line(X4)
| ~ line(X2)
| ~ point(X3)
| ~ point(X1)
| ~ on(X3,X4)
| ~ on(X1,X4)
| ~ on(X3,X2)
| ~ on(X1,X2)
| X2 = X4
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO003-0.ax',axiom_G1D) ).
cnf(prove_points_noncollinear,negated_conjecture,
collinear(point1,point2,point3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_points_noncollinear) ).
cnf(point3,hypothesis,
point(point3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point3) ).
cnf(point2,hypothesis,
point(point2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point2) ).
cnf(point1,hypothesis,
point(point1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point1) ).
cnf(axiom_G10A,axiom,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X1,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO003-0.ax',axiom_G10A) ).
cnf(axiom_G10C,axiom,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X3,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO003-0.ax',axiom_G10C) ).
cnf(point1_on_line,hypothesis,
on(point1,a_line),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point1_on_line) ).
cnf(line,hypothesis,
line(a_line),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',line) ).
cnf(point2_on_line,hypothesis,
on(point2,a_line),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point2_on_line) ).
cnf(point3_not_on_line,hypothesis,
~ on(point3,a_line),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',point3_not_on_line) ).
cnf(c_0_16,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X2,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_G10B]) ).
cnf(c_0_17,hypothesis,
point2 != point3,
inference(fof_simplification,[status(thm)],[point2_not_point3]) ).
cnf(c_0_18,hypothesis,
point1 != point3,
inference(fof_simplification,[status(thm)],[point1_not_point3]) ).
cnf(c_0_19,hypothesis,
point1 != point2,
inference(fof_simplification,[status(thm)],[point1_not_point2]) ).
cnf(c_0_20,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| line(line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_G10D]) ).
cnf(c_0_21,plain,
( ~ line(X4)
| ~ line(X2)
| ~ point(X3)
| ~ point(X1)
| ~ on(X3,X4)
| ~ on(X1,X4)
| ~ on(X3,X2)
| ~ on(X1,X2)
| X2 = X4
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[axiom_G1D]) ).
cnf(c_0_22,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X2,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
collinear(point1,point2,point3),
prove_points_noncollinear ).
cnf(c_0_24,hypothesis,
point(point3),
point3 ).
cnf(c_0_25,hypothesis,
point(point2),
point2 ).
cnf(c_0_26,hypothesis,
point(point1),
point1 ).
cnf(c_0_27,hypothesis,
point2 != point3,
c_0_17 ).
cnf(c_0_28,hypothesis,
point1 != point3,
c_0_18 ).
cnf(c_0_29,hypothesis,
point1 != point2,
c_0_19 ).
cnf(c_0_30,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| line(line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
c_0_20 ).
cnf(c_0_31,plain,
( ~ line(X4)
| ~ line(X2)
| ~ point(X3)
| ~ point(X1)
| ~ on(X3,X4)
| ~ on(X1,X4)
| ~ on(X3,X2)
| ~ on(X1,X2)
| X2 = X4
| X1 = X3 ),
c_0_21 ).
cnf(c_0_32,negated_conjecture,
on(point2,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_22,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
line(line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_30,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_34,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X1,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_G10A]) ).
cnf(c_0_35,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X3,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[axiom_G10C]) ).
cnf(c_0_36,negated_conjecture,
( ~ on(X2,X1)
| ~ on(point2,X1)
| ~ on(X2,line_through_3_points(point1,point2,point3))
| ~ point(X2)
| ~ line(X1)
| X2 = point2
| X1 = line_through_3_points(point1,point2,point3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_25])]) ).
cnf(c_0_37,hypothesis,
on(point1,a_line),
point1_on_line ).
cnf(c_0_38,hypothesis,
line(a_line),
line ).
cnf(c_0_39,hypothesis,
on(point2,a_line),
point2_on_line ).
cnf(c_0_40,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X1,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
c_0_34 ).
cnf(c_0_41,plain,
( ~ collinear(X1,X2,X3)
| ~ point(X3)
| ~ point(X2)
| ~ point(X1)
| on(X3,line_through_3_points(X1,X2,X3))
| X2 = X3
| X1 = X3
| X1 = X2 ),
c_0_35 ).
cnf(c_0_42,hypothesis,
( ~ on(point1,line_through_3_points(point1,point2,point3))
| line_through_3_points(point1,point2,point3) = a_line ),
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_36,c_0_37]),c_0_38]),c_0_26]),c_0_39])]),c_0_29]) ).
cnf(c_0_43,negated_conjecture,
on(point1,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_40,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_44,hypothesis,
~ on(point3,a_line),
inference(fof_simplification,[status(thm)],[point3_not_on_line]) ).
cnf(c_0_45,negated_conjecture,
on(point3,line_through_3_points(point1,point2,point3)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_41,c_0_23]),c_0_24]),c_0_25]),c_0_26])]),c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_46,hypothesis,
line_through_3_points(point1,point2,point3) = a_line,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_47,hypothesis,
~ on(point3,a_line),
c_0_44 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO077-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.47 % Computer : n014.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Sun Sep 20 09:56:50 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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.24/0.66 % Version: 3.5.1
% 0.24/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.66 % Starting sh5l with 300s (1) cores
% 0.24/0.66 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1448980 completed with status 0
% 0.24/0.66 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.66 % No SInE strategy applied
% 0.24/0.66 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.24/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.24/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.66 % new_bool_1 with pid 1448990 completed with status 0
% 0.24/0.66 % Result found by new_bool_1
% 0.24/0.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.66 % No SInE strategy applied
% 0.24/0.66 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.24/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.24/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.24/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.24/0.66 % Preprocessing time : 0.003 s
% 0.24/0.66 % Presaturation interreduction done
% 0.24/0.66
% 0.24/0.66 % Proof found!
% 0.24/0.66 % SZS status Unsatisfiable
% 0.24/0.66 % SZS output start CNFRefutation
% See solution above
% 0.24/0.66 % Parsed axioms : 42
% 0.24/0.66 % Removed by relevancy pruning/SinE : 0
% 0.24/0.66 % Initial clauses : 42
% 0.24/0.66 % Removed in clause preprocessing : 0
% 0.24/0.66 % Initial clauses in saturation : 42
% 0.24/0.66 % Processed clauses : 107
% 0.24/0.66 % ...of these trivial : 0
% 0.24/0.66 % ...subsumed : 3
% 0.24/0.66 % ...remaining for further processing : 104
% 0.24/0.66 % Other redundant clauses eliminated : 0
% 0.24/0.66 % Clauses deleted for lack of memory : 0
% 0.24/0.66 % Backward-subsumed : 0
% 0.24/0.66 % Backward-rewritten : 15
% 0.24/0.66 % Generated clauses : 84
% 0.24/0.66 % ...of the previous two non-redundant : 92
% 0.24/0.66 % ...aggressively subsumed : 0
% 0.24/0.66 % Contextual simplify-reflections : 5
% 0.24/0.66 % Paramodulations : 84
% 0.24/0.66 % Factorizations : 0
% 0.24/0.66 % NegExts : 0
% 0.24/0.66 % Equation resolutions : 0
% 0.24/0.66 % Disequality decompositions : 0
% 0.24/0.66 % Total rewrite steps : 98
% 0.24/0.66 % ...of those cached : 88
% 0.24/0.66 % Propositional unsat checks : 0
% 0.24/0.66 % Propositional check models : 0
% 0.24/0.66 % Propositional check unsatisfiable : 0
% 0.24/0.66 % Propositional clauses : 0
% 0.24/0.66 % Propositional clauses after purity: 0
% 0.24/0.66 % Propositional unsat core size : 0
% 0.24/0.66 % Propositional preprocessing time : 0.000
% 0.24/0.66 % Propositional encoding time : 0.000
% 0.24/0.66 % Propositional solver time : 0.000
% 0.24/0.66 % Success case prop preproc time : 0.000
% 0.24/0.66 % Success case prop encoding time : 0.000
% 0.24/0.66 % Success case prop solver time : 0.000
% 0.24/0.66 % Current number of processed clauses : 47
% 0.24/0.66 % Positive orientable unit clauses : 9
% 0.24/0.66 % Positive unorientable unit clauses: 0
% 0.24/0.66 % Negative unit clauses : 4
% 0.24/0.66 % Non-unit-clauses : 34
% 0.24/0.66 % Current number of unprocessed clauses: 62
% 0.24/0.66 % ...number of literals in the above : 437
% 0.24/0.66 % Current number of archived formulas : 0
% 0.24/0.66 % Current number of archived clauses : 57
% 0.24/0.66 % Clause-clause subsumption calls (NU) : 777
% 0.24/0.66 % Rec. Clause-clause subsumption calls : 55
% 0.24/0.66 % Non-unit clause-clause subsumptions : 5
% 0.24/0.66 % Unit Clause-clause subsumption calls : 6
% 0.24/0.66 % Rewrite failures with RHS unbound : 0
% 0.24/0.66 % BW rewrite match attempts : 2
% 0.24/0.66 % BW rewrite match successes : 2
% 0.24/0.66 % Condensation attempts : 0
% 0.24/0.66 % Condensation successes : 0
% 0.24/0.66 % Termbank termtop insertions : 5384
% 0.24/0.66 % Search garbage collected termcells : 154
% 0.24/0.66
% 0.24/0.66 % -------------------------------------------------
% 0.24/0.66 % User time : 0.017 s
% 0.24/0.66 % System time : 0.007 s
% 0.24/0.66 % Total time : 0.024 s
% 0.24/0.66 % Maximum resident set size: 3424 pages
% 0.24/0.66
% 0.24/0.66 % -------------------------------------------------
% 0.24/0.66 % User time : 0.050 s
% 0.24/0.66 % System time : 0.020 s
% 0.24/0.66 % Total time : 0.070 s
% 0.24/0.66 % Maximum resident set size: 4608 pages
% 0.24/0.66 % E exiting
%------------------------------------------------------------------------------