%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO076-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of clauses : 59 ( 10 unt; 24 nHn; 59 RR)
% Number of literals : 176 ( 44 equ; 97 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_point_is_not_on_every_line,negated_conjecture,
( ~ line(X1)
| on(a_point,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_point_is_not_on_every_line) ).
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/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G1D) ).
cnf(axiom_G4A,axiom,
line(at_least_one_line),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G4A) ).
cnf(there_is_a_point,hypothesis,
point(a_point),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',there_is_a_point) ).
cnf(axiom_G2B,axiom,
( ~ line(X1)
| on(point_2_on_line(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G2B) ).
cnf(axiom_G1A,axiom,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| on(X1,line_from_to(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G1A) ).
cnf(axiom_G1C,axiom,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| line(line_from_to(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G1C) ).
cnf(axiom_G1B,axiom,
( ~ point(X1)
| ~ point(X2)
| X2 = X1
| on(X1,line_from_to(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G1B) ).
cnf(axiom_G2D,axiom,
( ~ line(X1)
| point(point_2_on_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G2D) ).
cnf(axiom_G3B,axiom,
( ~ line(X1)
| point(point_not_on_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G3B) ).
cnf(axiom_G3A,axiom,
( ~ line(X1)
| ~ on(point_not_on_line(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G3A) ).
cnf(axiom_G2A,axiom,
( ~ line(X1)
| on(point_1_on_line(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G2A) ).
cnf(axiom_G2E,axiom,
( ~ line(X1)
| point_1_on_line(X1) != point_2_on_line(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G2E) ).
cnf(axiom_G2C,axiom,
( ~ line(X1)
| point(point_1_on_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO003-0.ax',axiom_G2C) ).
cnf(c_0_14,negated_conjecture,
( ~ line(X1)
| on(a_point,X1) ),
inference(fof_simplification,[status(thm)],[prove_point_is_not_on_every_line]) ).
cnf(c_0_15,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_16,negated_conjecture,
( ~ line(X1)
| on(a_point,X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
line(at_least_one_line),
axiom_G4A ).
cnf(c_0_18,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_15 ).
cnf(c_0_19,negated_conjecture,
on(a_point,at_least_one_line),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
point(a_point),
there_is_a_point ).
cnf(c_0_21,plain,
( ~ line(X1)
| on(point_2_on_line(X1),X1) ),
inference(fof_simplification,[status(thm)],[axiom_G2B]) ).
cnf(c_0_22,negated_conjecture,
( ~ on(X2,X1)
| ~ on(X2,at_least_one_line)
| ~ point(X2)
| ~ line(X1)
| X2 = a_point
| X1 = at_least_one_line ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_20])]),c_0_16]) ).
cnf(c_0_23,plain,
( ~ line(X1)
| on(point_2_on_line(X1),X1) ),
c_0_21 ).
cnf(c_0_24,plain,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| on(X1,line_from_to(X1,X2)) ),
inference(fof_simplification,[status(thm)],[axiom_G1A]) ).
cnf(c_0_25,plain,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| line(line_from_to(X1,X2)) ),
inference(fof_simplification,[status(thm)],[axiom_G1C]) ).
cnf(c_0_26,plain,
( ~ point(X1)
| ~ point(X2)
| X2 = X1
| on(X1,line_from_to(X2,X1)) ),
inference(fof_simplification,[status(thm)],[axiom_G1B]) ).
cnf(c_0_27,negated_conjecture,
( ~ on(point_2_on_line(at_least_one_line),X1)
| ~ point(point_2_on_line(at_least_one_line))
| ~ line(X1)
| X1 = at_least_one_line
| point_2_on_line(at_least_one_line) = a_point ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_17])]) ).
cnf(c_0_28,plain,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| on(X1,line_from_to(X1,X2)) ),
c_0_24 ).
cnf(c_0_29,plain,
( ~ point(X2)
| ~ point(X1)
| X1 = X2
| line(line_from_to(X1,X2)) ),
c_0_25 ).
cnf(c_0_30,plain,
( ~ point(X1)
| ~ point(X2)
| X2 = X1
| on(X1,line_from_to(X2,X1)) ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
( ~ point(X1)
| ~ point(point_2_on_line(at_least_one_line))
| point_2_on_line(at_least_one_line) = X1
| point_2_on_line(at_least_one_line) = a_point
| line_from_to(point_2_on_line(at_least_one_line),X1) = at_least_one_line ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ line(X1)
| point(point_2_on_line(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_G2D]) ).
cnf(c_0_33,negated_conjecture,
( ~ point(X1)
| ~ point(point_2_on_line(at_least_one_line))
| on(X1,at_least_one_line)
| X1 = point_2_on_line(at_least_one_line)
| point_2_on_line(at_least_one_line) = a_point ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
( ~ line(X1)
| point(point_2_on_line(X1)) ),
c_0_32 ).
cnf(c_0_35,plain,
( ~ line(X1)
| point(point_not_on_line(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_G3B]) ).
cnf(c_0_36,plain,
( ~ line(X1)
| ~ on(point_not_on_line(X1),X1) ),
inference(fof_simplification,[status(thm)],[axiom_G3A]) ).
cnf(c_0_37,negated_conjecture,
( ~ point(X1)
| on(X1,at_least_one_line)
| X1 = point_2_on_line(at_least_one_line)
| point_2_on_line(at_least_one_line) = a_point ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_17])]) ).
cnf(c_0_38,plain,
( ~ line(X1)
| point(point_not_on_line(X1)) ),
c_0_35 ).
cnf(c_0_39,plain,
( ~ line(X1)
| ~ on(point_not_on_line(X1),X1) ),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
( ~ line(X1)
| on(point_not_on_line(X1),at_least_one_line)
| point_2_on_line(at_least_one_line) = a_point
| point_not_on_line(X1) = point_2_on_line(at_least_one_line) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( point_2_on_line(at_least_one_line) = a_point
| point_not_on_line(at_least_one_line) = point_2_on_line(at_least_one_line) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_17])]) ).
cnf(c_0_42,plain,
( ~ line(X1)
| on(point_1_on_line(X1),X1) ),
inference(fof_simplification,[status(thm)],[axiom_G2A]) ).
cnf(c_0_43,plain,
( ~ line(X1)
| point_1_on_line(X1) != point_2_on_line(X1) ),
inference(fof_simplification,[status(thm)],[axiom_G2E]) ).
cnf(c_0_44,negated_conjecture,
( ~ on(point_2_on_line(at_least_one_line),at_least_one_line)
| point_2_on_line(at_least_one_line) = a_point ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_41]),c_0_17])]) ).
cnf(c_0_45,plain,
( ~ line(X1)
| on(point_1_on_line(X1),X1) ),
c_0_42 ).
cnf(c_0_46,plain,
( ~ line(X1)
| point_1_on_line(X1) != point_2_on_line(X1) ),
c_0_43 ).
cnf(c_0_47,negated_conjecture,
point_2_on_line(at_least_one_line) = a_point,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_17])]) ).
cnf(c_0_48,negated_conjecture,
( ~ on(point_1_on_line(at_least_one_line),X1)
| ~ point(point_1_on_line(at_least_one_line))
| ~ line(X1)
| X1 = at_least_one_line
| point_1_on_line(at_least_one_line) = a_point ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_45]),c_0_17])]) ).
cnf(c_0_49,negated_conjecture,
point_1_on_line(at_least_one_line) != a_point,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_17])]) ).
cnf(c_0_50,negated_conjecture,
( ~ point(X1)
| ~ point(point_1_on_line(at_least_one_line))
| point_1_on_line(at_least_one_line) = X1
| line_from_to(point_1_on_line(at_least_one_line),X1) = at_least_one_line ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_28]),c_0_49]),c_0_29]) ).
cnf(c_0_51,plain,
( ~ line(X1)
| point(point_1_on_line(X1)) ),
inference(fof_simplification,[status(thm)],[axiom_G2C]) ).
cnf(c_0_52,negated_conjecture,
( ~ point(X1)
| ~ point(point_1_on_line(at_least_one_line))
| on(X1,at_least_one_line)
| X1 = point_1_on_line(at_least_one_line) ),
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_53,plain,
( ~ line(X1)
| point(point_1_on_line(X1)) ),
c_0_51 ).
cnf(c_0_54,negated_conjecture,
( ~ point(X1)
| on(X1,at_least_one_line)
| X1 = point_1_on_line(at_least_one_line) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_17])]) ).
cnf(c_0_55,negated_conjecture,
( ~ line(X1)
| on(point_not_on_line(X1),at_least_one_line)
| point_not_on_line(X1) = point_1_on_line(at_least_one_line) ),
inference(spm,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_56,negated_conjecture,
point_not_on_line(at_least_one_line) = point_1_on_line(at_least_one_line),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_55]),c_0_17])]) ).
cnf(c_0_57,negated_conjecture,
~ on(point_1_on_line(at_least_one_line),at_least_one_line),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_56]),c_0_17])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_45]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO076-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n002.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 20 09:51:16 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 0.18/0.47 % Version: 3.5.1
% 0.18/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.18/0.47 % Starting sh5l with 300s (1) cores
% 0.18/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 770859 completed with status 0
% 0.18/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.18/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.47 % No SInE strategy applied
% 0.18/0.47 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.18/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.18/0.47 % Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 166s (1) cores
% 0.18/0.47 % Starting new_bool_3 with 162s (1) cores
% 0.18/0.47 % Starting new_bool_1 with 158s (1) cores
% 0.18/0.47 % SubtermCWHack with pid 770865 completed with status 0
% 0.18/0.47 % Result found by SubtermCWHack
% 0.18/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/0.47 % No SInE strategy applied
% 0.18/0.47 % Search class: FGHSF-FFMF31-SFFFFFNN
% 0.18/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.18/0.47 % Preprocessing time : 0.002 s
% 0.18/0.47
% 0.18/0.47 % Proof found!
% 0.18/0.47 % SZS status Unsatisfiable
% 0.18/0.47 % SZS output start CNFRefutation
% See solution above
% 0.18/0.47 % Parsed axioms : 33
% 0.18/0.47 % Removed by relevancy pruning/SinE : 0
% 0.18/0.47 % Initial clauses : 33
% 0.18/0.47 % Removed in clause preprocessing : 0
% 0.18/0.47 % Initial clauses in saturation : 33
% 0.18/0.47 % Processed clauses : 72
% 0.18/0.47 % ...of these trivial : 0
% 0.18/0.47 % ...subsumed : 1
% 0.18/0.47 % ...remaining for further processing : 71
% 0.18/0.47 % Other redundant clauses eliminated : 0
% 0.18/0.47 % Clauses deleted for lack of memory : 0
% 0.18/0.47 % Backward-subsumed : 18
% 0.18/0.47 % Backward-rewritten : 11
% 0.18/0.47 % Generated clauses : 149
% 0.18/0.47 % ...of the previous two non-redundant : 139
% 0.18/0.47 % ...aggressively subsumed : 0
% 0.18/0.47 % Contextual simplify-reflections : 8
% 0.18/0.47 % Paramodulations : 149
% 0.18/0.47 % Factorizations : 0
% 0.18/0.47 % NegExts : 0
% 0.18/0.47 % Equation resolutions : 0
% 0.18/0.47 % Disequality decompositions : 0
% 0.18/0.47 % Total rewrite steps : 90
% 0.18/0.47 % ...of those cached : 85
% 0.18/0.47 % Propositional unsat checks : 0
% 0.18/0.47 % Propositional check models : 0
% 0.18/0.47 % Propositional check unsatisfiable : 0
% 0.18/0.47 % Propositional clauses : 0
% 0.18/0.47 % Propositional clauses after purity: 0
% 0.18/0.47 % Propositional unsat core size : 0
% 0.18/0.47 % Propositional preprocessing time : 0.000
% 0.18/0.47 % Propositional encoding time : 0.000
% 0.18/0.47 % Propositional solver time : 0.000
% 0.18/0.47 % Success case prop preproc time : 0.000
% 0.18/0.47 % Success case prop encoding time : 0.000
% 0.18/0.47 % Success case prop solver time : 0.000
% 0.18/0.47 % Current number of processed clauses : 42
% 0.18/0.47 % Positive orientable unit clauses : 6
% 0.18/0.47 % Positive unorientable unit clauses: 0
% 0.18/0.47 % Negative unit clauses : 3
% 0.18/0.47 % Non-unit-clauses : 33
% 0.18/0.47 % Current number of unprocessed clauses: 96
% 0.18/0.47 % ...number of literals in the above : 990
% 0.18/0.47 % Current number of archived formulas : 0
% 0.18/0.47 % Current number of archived clauses : 29
% 0.18/0.47 % Clause-clause subsumption calls (NU) : 642
% 0.18/0.47 % Rec. Clause-clause subsumption calls : 102
% 0.18/0.47 % Non-unit clause-clause subsumptions : 15
% 0.18/0.47 % Unit Clause-clause subsumption calls : 76
% 0.18/0.47 % Rewrite failures with RHS unbound : 0
% 0.18/0.47 % BW rewrite match attempts : 2
% 0.18/0.47 % BW rewrite match successes : 2
% 0.18/0.47 % Condensation attempts : 0
% 0.18/0.47 % Condensation successes : 0
% 0.18/0.47 % Termbank termtop insertions : 5472
% 0.18/0.47 % Search garbage collected termcells : 147
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.011 s
% 0.18/0.47 % System time : 0.004 s
% 0.18/0.47 % Total time : 0.015 s
% 0.18/0.47 % Maximum resident set size: 3672 pages
% 0.18/0.47
% 0.18/0.47 % -------------------------------------------------
% 0.18/0.47 % User time : 0.045 s
% 0.18/0.47 % System time : 0.012 s
% 0.18/0.47 % Total time : 0.057 s
% 0.18/0.47 % Maximum resident set size: 4608 pages
% 0.18/0.47 % E exiting
%------------------------------------------------------------------------------