%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO172+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:32 PM UTC 2026
% Result : Theorem 0.13s 0.43s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 20 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 51 ~; 45 |; 11 &)
% ( 0 <=>; 9 =>; 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( ~ apart_point_and_line(X3,X2)
& ~ apart_point_and_line(X3,X1)
& convergent_lines(X1,X2) )
=> ~ distinct_points(X3,intersection_point(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(apart6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
fof(apart5,axiom,
! [X1,X2,X3] :
( distinct_lines(X1,X2)
=> ( distinct_lines(X2,X3)
| distinct_lines(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart5) ).
fof(ceq3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart2) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
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/sandbox2/benchmark/Axioms/GEO008+0.ax',cu1) ).
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/sandbox2/benchmark/Axioms/GEO008+0.ax',con2) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(X3,X2)
& ~ apart_point_and_line(X3,X1)
& convergent_lines(X1,X2) )
=> ~ distinct_points(X3,intersection_point(X1,X2)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(X3,X2)
& ~ apart_point_and_line(X3,X1)
& convergent_lines(X1,X2) )
=> ~ distinct_points(X3,intersection_point(X1,X2)) ),
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,
! [X27,X28,X29] :
( convergent_lines(X28,X29)
| convergent_lines(X27,X29)
| ~ convergent_lines(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])]) ).
fof(c_0_13,negated_conjecture,
( distinct_points(esk3_0,intersection_point(esk1_0,esk2_0))
& ~ apart_point_and_line(esk3_0,esk2_0)
& ~ apart_point_and_line(esk3_0,esk1_0)
& convergent_lines(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X33,X34,X35] :
( distinct_lines(X34,X35)
| distinct_lines(X33,X35)
| ~ distinct_lines(X33,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])])]) ).
fof(c_0_15,plain,
! [X30,X31] :
( distinct_lines(X30,X31)
| ~ convergent_lines(X30,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
fof(c_0_16,plain,
! [X26] : ~ convergent_lines(X26,X26),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_17,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
cnf(c_0_20,plain,
( ~ distinct_lines(X1,X2)
| distinct_lines(X2,X3)
| distinct_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ convergent_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X32] : ~ distinct_lines(X32,X32),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).
cnf(c_0_25,plain,
( ~ convergent_lines(X3,X1)
| distinct_lines(X3,X2)
| distinct_lines(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
convergent_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_27,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_28,plain,
! [X16,X17,X18,X19] :
( apart_point_and_line(X17,X19)
| apart_point_and_line(X17,X18)
| apart_point_and_line(X16,X19)
| apart_point_and_line(X16,X18)
| ~ distinct_lines(X18,X19)
| ~ distinct_points(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_29,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( distinct_lines(esk1_0,X1)
| distinct_lines(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_31,plain,
! [X9] : ~ distinct_points(X9,X9),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_27])]) ).
fof(c_0_32,plain,
! [X13,X14,X15] :
( ( ~ convergent_lines(X13,X14)
| distinct_points(X15,intersection_point(X13,X14))
| ~ apart_point_and_line(X15,X14) )
& ( ~ convergent_lines(X13,X14)
| distinct_points(X15,intersection_point(X13,X14))
| ~ apart_point_and_line(X15,X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])]) ).
cnf(c_0_33,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_28]) ).
cnf(c_0_34,negated_conjecture,
distinct_lines(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,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_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ distinct_points(X2,X1)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
distinct_points(esk3_0,intersection_point(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_39,negated_conjecture,
~ apart_point_and_line(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,negated_conjecture,
~ apart_point_and_line(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,plain,
( ~ convergent_lines(X3,X2)
| ~ apart_point_and_line(X1,X2)
| distinct_points(X1,intersection_point(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_42,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
( ~ convergent_lines(X1,X2)
| ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_18])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO172+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n001.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 13:01:56 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.40 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.13/0.43 % Version: 3.5.1
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % sh5l with pid 699523 completed with status 0
% 0.13/0.43 % Result found by sh5l
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.43 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % SubtermCWHack with pid 699524 completed with status 0
% 0.13/0.43 % Result found by SubtermCWHack
% 0.13/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.43 % Starting sh5l with 300s (1) cores
% 0.13/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.43 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.13/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.43 % Preprocessing time : 0.001 s
% 0.13/0.43
% 0.13/0.43 % Proof found!
% 0.13/0.43 % SZS status Theorem
% 0.13/0.43 % SZS output start CNFRefutation
% See solution above
% 0.13/0.43 % Parsed axioms : 13
% 0.13/0.43 % Removed by relevancy pruning/SinE : 1
% 0.13/0.43 % Initial clauses : 16
% 0.13/0.43 % Removed in clause preprocessing : 0
% 0.13/0.43 % Initial clauses in saturation : 16
% 0.13/0.43 % Processed clauses : 281
% 0.13/0.43 % ...of these trivial : 0
% 0.13/0.43 % ...subsumed : 186
% 0.13/0.43 % ...remaining for further processing : 95
% 0.13/0.43 % Other redundant clauses eliminated : 0
% 0.13/0.43 % Clauses deleted for lack of memory : 0
% 0.13/0.43 % Backward-subsumed : 0
% 0.13/0.43 % Backward-rewritten : 1
% 0.13/0.43 % Generated clauses : 678
% 0.13/0.43 % ...of the previous two non-redundant : 562
% 0.13/0.43 % ...aggressively subsumed : 0
% 0.13/0.43 % Contextual simplify-reflections : 0
% 0.13/0.43 % Paramodulations : 498
% 0.13/0.43 % Factorizations : 180
% 0.13/0.43 % NegExts : 0
% 0.13/0.43 % Equation resolutions : 0
% 0.13/0.43 % Disequality decompositions : 0
% 0.13/0.43 % Total rewrite steps : 118
% 0.13/0.43 % ...of those cached : 112
% 0.13/0.43 % Propositional unsat checks : 0
% 0.13/0.43 % Propositional check models : 0
% 0.13/0.43 % Propositional check unsatisfiable : 0
% 0.13/0.43 % Propositional clauses : 0
% 0.13/0.43 % Propositional clauses after purity: 0
% 0.13/0.43 % Propositional unsat core size : 0
% 0.13/0.43 % Propositional preprocessing time : 0.000
% 0.13/0.43 % Propositional encoding time : 0.000
% 0.13/0.43 % Propositional solver time : 0.000
% 0.13/0.43 % Success case prop preproc time : 0.000
% 0.13/0.43 % Success case prop encoding time : 0.000
% 0.13/0.43 % Success case prop solver time : 0.000
% 0.13/0.43 % Current number of processed clauses : 94
% 0.13/0.43 % Positive orientable unit clauses : 6
% 0.13/0.43 % Positive unorientable unit clauses: 0
% 0.13/0.43 % Negative unit clauses : 5
% 0.13/0.43 % Non-unit-clauses : 83
% 0.13/0.43 % Current number of unprocessed clauses: 293
% 0.13/0.43 % ...number of literals in the above : 1576
% 0.13/0.43 % Current number of archived formulas : 0
% 0.13/0.43 % Current number of archived clauses : 1
% 0.13/0.43 % Clause-clause subsumption calls (NU) : 3036
% 0.13/0.43 % Rec. Clause-clause subsumption calls : 1113
% 0.13/0.43 % Non-unit clause-clause subsumptions : 185
% 0.13/0.43 % Unit Clause-clause subsumption calls : 14
% 0.13/0.43 % Rewrite failures with RHS unbound : 0
% 0.13/0.43 % BW rewrite match attempts : 1
% 0.13/0.43 % BW rewrite match successes : 1
% 0.13/0.43 % Condensation attempts : 0
% 0.13/0.43 % Condensation successes : 0
% 0.13/0.43 % Termbank termtop insertions : 7310
% 0.13/0.43 % Search garbage collected termcells : 201
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.010 s
% 0.13/0.43 % System time : 0.002 s
% 0.13/0.43 % Total time : 0.012 s
% 0.13/0.43 % Maximum resident set size: 3648 pages
% 0.13/0.43
% 0.13/0.43 % -------------------------------------------------
% 0.13/0.43 % User time : 0.011 s
% 0.13/0.43 % System time : 0.005 s
% 0.13/0.43 % Total time : 0.016 s
% 0.13/0.43 % Maximum resident set size: 4608 pages
% 0.13/0.43 % E exiting
%------------------------------------------------------------------------------