%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO203+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 : 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:27:44 PM UTC 2026
% Result : Theorem 0.17s 0.58s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 88 ( 38 ~; 29 |; 10 &)
% ( 0 <=>; 11 =>; 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 : 61 ( 0 sgn 44 !; 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/GEO006+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/GEO006+0.ax',apart5) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci2) ).
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(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_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,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_16,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
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,
! [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_19,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,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]) ).
fof(c_0_21,plain,
! [X18,X19] :
( ~ apart_point_and_line(X18,line_connecting(X18,X19))
| ~ distinct_points(X18,X19) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
fof(c_0_22,plain,
! [X20,X21] :
( ~ apart_point_and_line(X21,line_connecting(X20,X21))
| ~ distinct_points(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
fof(c_0_23,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_24,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_18]) ).
cnf(c_0_25,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_19,c_0_20]) ).
cnf(c_0_26,plain,
( ~ apart_point_and_line(X1,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,plain,
( ~ apart_point_and_line(X2,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_32,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_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
~ 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(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
~ 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_28,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_33]),c_0_34]),c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO203+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.10/0.50 % Computer : n020.cluster.edu
% 0.10/0.50 % Model : x86_64 x86_64
% 0.10/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.50 % Memory : 8046.5625MB
% 0.10/0.50 % OS : Linux 6.8.0-71-generic
% 0.10/0.50 % CPULimit : 300
% 0.10/0.50 % WCLimit : 300
% 0.10/0.50 % DateTime : Sun Sep 20 13:24:18 UTC 2026
% 0.10/0.51 % CPUTime :
% 0.10/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.55 Running first-order theorem proving
% 0.10/0.55 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.17/0.58 % Version: 3.5.1
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.58 % Starting sh5l with 300s (1) cores
% 0.17/0.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 600539 completed with status 0
% 0.17/0.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.58 % No SInE strategy applied
% 0.17/0.58 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.17/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.58 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.58 % new_bool_3 with pid 600548 completed with status 0
% 0.17/0.58 % Result found by new_bool_3
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.58 % No SInE strategy applied
% 0.17/0.58 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.17/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.58 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.58 % Preprocessing time : 0.001 s
% 0.17/0.58 % Presaturation interreduction done
% 0.17/0.58
% 0.17/0.58 % Proof found!
% 0.17/0.58 % SZS status Theorem
% 0.17/0.58 % SZS output start CNFRefutation
% See solution above
% 0.17/0.58 % Parsed axioms : 15
% 0.17/0.58 % Removed by relevancy pruning/SinE : 0
% 0.17/0.58 % Initial clauses : 18
% 0.17/0.58 % Removed in clause preprocessing : 0
% 0.17/0.58 % Initial clauses in saturation : 18
% 0.17/0.58 % Processed clauses : 127
% 0.17/0.58 % ...of these trivial : 0
% 0.17/0.58 % ...subsumed : 17
% 0.17/0.58 % ...remaining for further processing : 110
% 0.17/0.58 % Other redundant clauses eliminated : 0
% 0.17/0.58 % Clauses deleted for lack of memory : 0
% 0.17/0.58 % Backward-subsumed : 0
% 0.17/0.58 % Backward-rewritten : 0
% 0.17/0.58 % Generated clauses : 210
% 0.17/0.58 % ...of the previous two non-redundant : 173
% 0.17/0.58 % ...aggressively subsumed : 0
% 0.17/0.58 % Contextual simplify-reflections : 0
% 0.17/0.58 % Paramodulations : 192
% 0.17/0.58 % Factorizations : 18
% 0.17/0.58 % NegExts : 0
% 0.17/0.58 % Equation resolutions : 0
% 0.17/0.58 % Disequality decompositions : 0
% 0.17/0.58 % Total rewrite steps : 30
% 0.17/0.58 % ...of those cached : 25
% 0.17/0.58 % Propositional unsat checks : 0
% 0.17/0.58 % Propositional check models : 0
% 0.17/0.58 % Propositional check unsatisfiable : 0
% 0.17/0.58 % Propositional clauses : 0
% 0.17/0.58 % Propositional clauses after purity: 0
% 0.17/0.58 % Propositional unsat core size : 0
% 0.17/0.58 % Propositional preprocessing time : 0.000
% 0.17/0.58 % Propositional encoding time : 0.000
% 0.17/0.58 % Propositional solver time : 0.000
% 0.17/0.58 % Success case prop preproc time : 0.000
% 0.17/0.58 % Success case prop encoding time : 0.000
% 0.17/0.58 % Success case prop solver time : 0.000
% 0.17/0.58 % Current number of processed clauses : 92
% 0.17/0.58 % Positive orientable unit clauses : 6
% 0.17/0.58 % Positive unorientable unit clauses: 0
% 0.17/0.58 % Negative unit clauses : 11
% 0.17/0.58 % Non-unit-clauses : 75
% 0.17/0.58 % Current number of unprocessed clauses: 82
% 0.17/0.58 % ...number of literals in the above : 377
% 0.17/0.58 % Current number of archived formulas : 0
% 0.17/0.58 % Current number of archived clauses : 18
% 0.17/0.58 % Clause-clause subsumption calls (NU) : 694
% 0.17/0.58 % Rec. Clause-clause subsumption calls : 502
% 0.17/0.58 % Non-unit clause-clause subsumptions : 17
% 0.17/0.58 % Unit Clause-clause subsumption calls : 143
% 0.17/0.58 % Rewrite failures with RHS unbound : 0
% 0.17/0.58 % BW rewrite match attempts : 0
% 0.17/0.58 % BW rewrite match successes : 0
% 0.17/0.58 % Condensation attempts : 0
% 0.17/0.58 % Condensation successes : 0
% 0.17/0.58 % Termbank termtop insertions : 4393
% 0.17/0.58 % Search garbage collected termcells : 207
% 0.17/0.58
% 0.17/0.58 % -------------------------------------------------
% 0.17/0.58 % User time : 0.011 s
% 0.17/0.58 % System time : 0.005 s
% 0.17/0.58 % Total time : 0.016 s
% 0.17/0.58 % Maximum resident set size: 3596 pages
% 0.17/0.58
% 0.17/0.58 % -------------------------------------------------
% 0.17/0.58 % User time : 0.054 s
% 0.17/0.58 % System time : 0.015 s
% 0.17/0.58 % Total time : 0.069 s
% 0.17/0.58 % Maximum resident set size: 4864 pages
% 0.17/0.58 % E exiting
%------------------------------------------------------------------------------