%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO201+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:39 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 46 ( 16 unt; 0 def)
% Number of atoms : 102 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 40 ~; 43 |; 2 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ distinct_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X2,X3)
| distinct_points(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart4) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_lines(X4,X5)
& distinct_points(X1,X2) )
=> ( apart_point_and_line(X2,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X1,X4) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ distinct_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ distinct_points(intersection_point(X1,X2),intersection_point(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_12,plain,
! [X15,X16,X17] :
( convergent_lines(X16,X17)
| convergent_lines(X15,X17)
| ~ convergent_lines(X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
fof(c_0_13,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0))
& convergent_lines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X36,X37,X38] :
( convergent_lines(X36,X38)
| distinct_lines(X37,X38)
| ~ convergent_lines(X36,X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
fof(c_0_15,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_16,plain,
! [X9,X10,X11] :
( distinct_points(X10,X11)
| distinct_points(X9,X11)
| ~ distinct_points(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])]) ).
fof(c_0_17,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_18,plain,
! [X8] : ~ convergent_lines(X8,X8),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_19,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_22,plain,
! [X26,X27,X28,X29] :
( apart_point_and_line(X27,X29)
| apart_point_and_line(X27,X28)
| apart_point_and_line(X26,X29)
| apart_point_and_line(X26,X28)
| ~ distinct_lines(X28,X29)
| ~ distinct_points(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_23,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X6] : ~ distinct_points(X6,X6),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_25,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X22,X23] :
( ~ apart_point_and_line(intersection_point(X22,X23),X22)
| ~ convergent_lines(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_28,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( convergent_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_30,plain,
! [X24,X25] :
( ~ apart_point_and_line(intersection_point(X24,X25),X25)
| ~ convergent_lines(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_31,plain,
( ~ distinct_lines(X3,X4)
| ~ distinct_points(X1,X2)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( distinct_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_33,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( distinct_points(intersection_point(esk2_0,esk1_0),X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( ~ distinct_points(X1,X2)
| convergent_lines(esk1_0,X3)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
distinct_points(intersection_point(esk2_0,esk1_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_42,negated_conjecture,
( ~ apart_point_and_line(intersection_point(esk1_0,X1),esk1_0)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( convergent_lines(esk1_0,X1)
| apart_point_and_line(intersection_point(esk2_0,esk1_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ apart_point_and_line(intersection_point(esk2_0,esk1_0),esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_28]),c_0_44]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO201+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 13:21:50 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 278542 completed with status 0
% 0.09/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.44 % new_bool_3 with pid 278551 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44 % No SInE strategy applied
% 0.09/0.44 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44 % Presaturation interreduction done
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 15
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 16
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 16
% 0.09/0.44 % Processed clauses : 212
% 0.09/0.44 % ...of these trivial : 0
% 0.09/0.44 % ...subsumed : 76
% 0.09/0.44 % ...remaining for further processing : 136
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 0
% 0.09/0.44 % Backward-rewritten : 0
% 0.09/0.44 % Generated clauses : 429
% 0.09/0.44 % ...of the previous two non-redundant : 345
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 361
% 0.09/0.44 % Factorizations : 68
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 53
% 0.09/0.44 % ...of those cached : 50
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 120
% 0.09/0.44 % Positive orientable unit clauses : 4
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 11
% 0.09/0.44 % Non-unit-clauses : 105
% 0.09/0.44 % Current number of unprocessed clauses: 162
% 0.09/0.44 % ...number of literals in the above : 785
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 16
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 2570
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 1733
% 0.09/0.44 % Non-unit clause-clause subsumptions : 76
% 0.09/0.44 % Unit Clause-clause subsumption calls : 30
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 0
% 0.09/0.44 % BW rewrite match successes : 0
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 6090
% 0.09/0.44 % Search garbage collected termcells : 180
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.019 s
% 0.09/0.44 % System time : 0.002 s
% 0.09/0.44 % Total time : 0.021 s
% 0.09/0.44 % Maximum resident set size: 3648 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.072 s
% 0.09/0.44 % System time : 0.016 s
% 0.09/0.44 % Total time : 0.088 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------