%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO186+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:38 PM UTC 2026
% Result : Theorem 0.17s 0.66s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 38 ~; 39 |; 13 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( incident_point_and_line(X1,X5)
& incident_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> equal_points(X1,intersection_point(X4,X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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(ax1,axiom,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax1) ).
fof(a4,axiom,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
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(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(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(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( incident_point_and_line(X1,X5)
& incident_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> equal_points(X1,intersection_point(X4,X5)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_9,plain,
! [X41,X42,X43] :
( convergent_lines(X41,X43)
| distinct_lines(X42,X43)
| ~ convergent_lines(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
fof(c_0_10,negated_conjecture,
( ~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0))
& incident_point_and_line(esk1_0,esk4_0)
& incident_point_and_line(esk1_0,esk3_0)
& convergent_lines(esk3_0,esk4_0)
& distinct_points(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_8])])])]) ).
fof(c_0_11,plain,
! [X1,X2] :
( equal_points(X1,X2)
<=> ~ distinct_points(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax1]) ).
fof(c_0_12,plain,
! [X1,X2] :
( incident_point_and_line(X1,X2)
<=> ~ apart_point_and_line(X1,X2) ),
inference(fof_simplification,[status(thm)],[a4]) ).
fof(c_0_13,plain,
! [X31,X32,X33,X34] :
( apart_point_and_line(X32,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X31,X33)
| ~ distinct_lines(X33,X34)
| ~ distinct_points(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_14,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X82,X83] :
( ( equal_points(X82,X83)
| distinct_points(X82,X83) )
& ( ~ distinct_points(X82,X83)
| ~ equal_points(X82,X83) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_17,plain,
! [X88,X89] :
( ( incident_point_and_line(X88,X89)
| apart_point_and_line(X88,X89) )
& ( ~ apart_point_and_line(X88,X89)
| ~ incident_point_and_line(X88,X89) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_18,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
cnf(c_0_19,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_13]) ).
cnf(c_0_20,negated_conjecture,
( distinct_lines(esk4_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
~ equal_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( equal_points(X1,X2)
| distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ apart_point_and_line(X1,X2)
| ~ incident_point_and_line(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
incident_point_and_line(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,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_26,plain,
! [X29,X30] :
( ~ apart_point_and_line(intersection_point(X29,X30),X30)
| ~ convergent_lines(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_27,negated_conjecture,
( ~ distinct_points(X1,X2)
| convergent_lines(esk3_0,X3)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,esk4_0)
| apart_point_and_line(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_31,plain,
! [X27,X28] :
( ~ apart_point_and_line(intersection_point(X27,X28),X27)
| ~ convergent_lines(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
cnf(c_0_32,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( convergent_lines(esk3_0,X1)
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
incident_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_35,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_30])]) ).
cnf(c_0_36,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,negated_conjecture,
( convergent_lines(esk3_0,X1)
| apart_point_and_line(esk1_0,X1)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_15])]) ).
cnf(c_0_38,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_39,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_15])]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO186+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.51 % Computer : n008.cluster.edu
% 0.12/0.51 % Model : x86_64 x86_64
% 0.12/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.51 % Memory : 8046.5625MB
% 0.12/0.51 % OS : Linux 6.8.0-71-generic
% 0.12/0.51 % CPULimit : 300
% 0.12/0.51 % WCLimit : 300
% 0.12/0.51 % DateTime : Sun Sep 20 13:13:42 UTC 2026
% 0.12/0.51 % CPUTime :
% 0.12/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.55 Running first-order theorem proving
% 0.12/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.66 % Version: 3.5.1
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.66 % Starting sh5l with 300s (1) cores
% 0.17/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2986621 completed with status 0
% 0.17/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.66 % No SInE strategy applied
% 0.17/0.66 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.17/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.66 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.66 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.66 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2986628 completed with status 0
% 0.17/0.66 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.66 % No SInE strategy applied
% 0.17/0.66 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.17/0.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.66 % Preprocessing time : 0.002 s
% 0.17/0.66 % Presaturation interreduction done
% 0.17/0.66
% 0.17/0.66 % Proof found!
% 0.17/0.66 % SZS status Theorem
% 0.17/0.66 % SZS output start CNFRefutation
% See solution above
% 0.17/0.66 % Parsed axioms : 36
% 0.17/0.66 % Removed by relevancy pruning/SinE : 0
% 0.17/0.66 % Initial clauses : 51
% 0.17/0.66 % Removed in clause preprocessing : 0
% 0.17/0.66 % Initial clauses in saturation : 51
% 0.17/0.66 % Processed clauses : 665
% 0.17/0.66 % ...of these trivial : 11
% 0.17/0.66 % ...subsumed : 299
% 0.17/0.66 % ...remaining for further processing : 355
% 0.17/0.66 % Other redundant clauses eliminated : 0
% 0.17/0.66 % Clauses deleted for lack of memory : 0
% 0.17/0.66 % Backward-subsumed : 11
% 0.17/0.66 % Backward-rewritten : 32
% 0.17/0.66 % Generated clauses : 3275
% 0.17/0.66 % ...of the previous two non-redundant : 2872
% 0.17/0.66 % ...aggressively subsumed : 0
% 0.17/0.66 % Contextual simplify-reflections : 2
% 0.17/0.66 % Paramodulations : 3125
% 0.17/0.66 % Factorizations : 150
% 0.17/0.66 % NegExts : 0
% 0.17/0.66 % Equation resolutions : 0
% 0.17/0.66 % Disequality decompositions : 0
% 0.17/0.66 % Total rewrite steps : 443
% 0.17/0.66 % ...of those cached : 400
% 0.17/0.66 % Propositional unsat checks : 0
% 0.17/0.66 % Propositional check models : 0
% 0.17/0.66 % Propositional check unsatisfiable : 0
% 0.17/0.66 % Propositional clauses : 0
% 0.17/0.66 % Propositional clauses after purity: 0
% 0.17/0.66 % Propositional unsat core size : 0
% 0.17/0.66 % Propositional preprocessing time : 0.000
% 0.17/0.66 % Propositional encoding time : 0.000
% 0.17/0.66 % Propositional solver time : 0.000
% 0.17/0.66 % Success case prop preproc time : 0.000
% 0.17/0.66 % Success case prop encoding time : 0.000
% 0.17/0.66 % Success case prop solver time : 0.000
% 0.17/0.66 % Current number of processed clauses : 265
% 0.17/0.66 % Positive orientable unit clauses : 29
% 0.17/0.66 % Positive unorientable unit clauses: 0
% 0.17/0.66 % Negative unit clauses : 10
% 0.17/0.66 % Non-unit-clauses : 226
% 0.17/0.66 % Current number of unprocessed clauses: 2158
% 0.17/0.66 % ...number of literals in the above : 10633
% 0.17/0.66 % Current number of archived formulas : 0
% 0.17/0.66 % Current number of archived clauses : 90
% 0.17/0.66 % Clause-clause subsumption calls (NU) : 22051
% 0.17/0.66 % Rec. Clause-clause subsumption calls : 7653
% 0.17/0.66 % Non-unit clause-clause subsumptions : 273
% 0.17/0.66 % Unit Clause-clause subsumption calls : 924
% 0.17/0.66 % Rewrite failures with RHS unbound : 0
% 0.17/0.66 % BW rewrite match attempts : 41
% 0.17/0.66 % BW rewrite match successes : 5
% 0.17/0.66 % Condensation attempts : 0
% 0.17/0.66 % Condensation successes : 0
% 0.17/0.66 % Termbank termtop insertions : 44425
% 0.17/0.66 % Search garbage collected termcells : 521
% 0.17/0.66
% 0.17/0.66 % -------------------------------------------------
% 0.17/0.66 % User time : 0.080 s
% 0.17/0.66 % System time : 0.008 s
% 0.17/0.66 % Total time : 0.088 s
% 0.17/0.66 % Maximum resident set size: 3680 pages
% 0.17/0.66
% 0.17/0.66 % -------------------------------------------------
% 0.17/0.66 % User time : 0.396 s
% 0.17/0.66 % System time : 0.028 s
% 0.17/0.66 % Total time : 0.424 s
% 0.17/0.66 % Maximum resident set size: 4608 pages
% 0.17/0.66 % E exiting
%------------------------------------------------------------------------------