%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO203+2 : 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 : n003.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:44 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 15 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 104 ( 36 ~; 46 |; 13 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))
& convergent_lines(X1,X3)
& convergent_lines(X1,X2) )
=> ~ distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart2) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| distinct_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart5) ).
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/GEO008+0.ax',cu1) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',apart1) ).
fof(con1,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( apart_point_and_line(X3,line_connecting(X1,X2))
=> ( distinct_points(X3,X2)
& distinct_points(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con1) ).
fof(con2,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( ( apart_point_and_line(X3,X2)
| apart_point_and_line(X3,X1) )
=> distinct_points(X3,intersection_point(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))
& convergent_lines(X1,X3)
& convergent_lines(X1,X2) )
=> ~ distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))
& convergent_lines(X1,X3)
& convergent_lines(X1,X2) )
=> ~ distinct_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_10,plain,
! [X12,X13,X14] :
( distinct_lines(X13,X14)
| distinct_lines(X12,X14)
| ~ distinct_lines(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
fof(c_0_11,negated_conjecture,
( distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)
& distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X7] : ~ distinct_lines(X7,X7),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X24,X25,X26,X27] :
( apart_point_and_line(X25,X27)
| apart_point_and_line(X25,X26)
| apart_point_and_line(X24,X27)
| apart_point_and_line(X24,X26)
| ~ distinct_lines(X26,X27)
| ~ distinct_points(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_16,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( distinct_lines(esk1_0,X1)
| distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,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_15]) ).
cnf(c_0_19,negated_conjecture,
distinct_lines(esk1_0,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_21,plain,
! [X18,X19,X20] :
( ( ~ distinct_points(X18,X19)
| ~ apart_point_and_line(X20,line_connecting(X18,X19))
| distinct_points(X20,X19) )
& ( ~ distinct_points(X18,X19)
| ~ apart_point_and_line(X20,line_connecting(X18,X19))
| distinct_points(X20,X18) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ distinct_points(X1,X2)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X6] : ~ distinct_points(X6,X6),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_20])]) ).
fof(c_0_25,plain,
! [X21,X22,X23] :
( ( ~ convergent_lines(X21,X22)
| distinct_points(X23,intersection_point(X21,X22))
| ~ apart_point_and_line(X23,X22) )
& ( ~ convergent_lines(X21,X22)
| distinct_points(X23,intersection_point(X21,X22))
| ~ apart_point_and_line(X23,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])]) ).
cnf(c_0_26,plain,
( ~ distinct_points(X3,X2)
| ~ apart_point_and_line(X1,line_connecting(X3,X2))
| distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( ~ convergent_lines(X2,X3)
| ~ apart_point_and_line(X1,X2)
| distinct_points(X1,intersection_point(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( ~ distinct_points(X2,X3)
| ~ apart_point_and_line(X1,line_connecting(X2,X3))
| distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
( ~ apart_point_and_line(X1,esk1_0)
| distinct_points(X1,intersection_point(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_23])]),c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( ~ apart_point_and_line(X1,esk1_0)
| distinct_points(X1,intersection_point(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_28]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO203+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n003.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 13:25:44 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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 1919970 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: FGUNF-FFSS22-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 1919977 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: FGUNF-FFSS22-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 : 13
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 18
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 18
% 0.09/0.44 % Processed clauses : 57
% 0.09/0.44 % ...of these trivial : 0
% 0.09/0.44 % ...subsumed : 1
% 0.09/0.44 % ...remaining for further processing : 56
% 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 : 2
% 0.09/0.44 % Backward-rewritten : 1
% 0.09/0.44 % Generated clauses : 62
% 0.09/0.44 % ...of the previous two non-redundant : 52
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 62
% 0.09/0.44 % Factorizations : 0
% 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 : 14
% 0.09/0.44 % ...of those cached : 8
% 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 : 35
% 0.09/0.44 % Positive orientable unit clauses : 8
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 3
% 0.09/0.44 % Non-unit-clauses : 24
% 0.09/0.44 % Current number of unprocessed clauses: 29
% 0.09/0.44 % ...number of literals in the above : 116
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 21
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 22
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 21
% 0.09/0.44 % Non-unit clause-clause subsumptions : 3
% 0.09/0.44 % Unit Clause-clause subsumption calls : 3
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 1
% 0.09/0.44 % BW rewrite match successes : 1
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 2307
% 0.09/0.44 % Search garbage collected termcells : 217
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.007 s
% 0.09/0.44 % System time : 0.001 s
% 0.09/0.44 % Total time : 0.008 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.019 s
% 0.09/0.44 % System time : 0.010 s
% 0.09/0.44 % Total time : 0.029 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------