%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO186+1 : 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 : n013.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:37 PM UTC 2026
% Result : Theorem 0.38s 0.48s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 94 ( 38 ~; 33 |; 14 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X1,X5)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_points(X1,intersection_point(X4,X5)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
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/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/sandbox2/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/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X1,X5)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_points(X1,intersection_point(X4,X5)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X1,X5)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_points(X1,intersection_point(X4,X5)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,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_9,negated_conjecture,
( distinct_points(esk1_0,intersection_point(esk3_0,esk4_0))
& ~ apart_point_and_line(esk1_0,esk4_0)
& ~ apart_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_7])])])]) ).
fof(c_0_10,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_11,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,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_14,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_10]) ).
cnf(c_0_15,negated_conjecture,
( distinct_lines(esk4_0,X1)
| convergent_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,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_17,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_13])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ distinct_points(X2,X1)
| 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_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
~ apart_point_and_line(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_21,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_22,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_16])])]) ).
cnf(c_0_23,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,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_18,c_0_19]),c_0_20]) ).
fof(c_0_25,plain,
! [X8] : ~ convergent_lines(X8,X8),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).
cnf(c_0_26,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,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_23,c_0_24]),c_0_12])]) ).
cnf(c_0_28,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,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_26,c_0_27]),c_0_12])]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO186+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 13:06:52 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.43 Running first-order theorem proving
% 0.10/0.43 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.38/0.48 % Version: 3.5.1
% 0.38/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.38/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.38/0.48 % Starting sh5l with 300s (1) cores
% 0.38/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2771371 completed with status 0
% 0.38/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.38/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.48 % No SInE strategy applied
% 0.38/0.48 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.38/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.38/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.38/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.38/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.38/0.48 % SubtermCWHack with pid 2771376 completed with status 0
% 0.38/0.48 % Result found by SubtermCWHack
% 0.38/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.38/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.38/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.38/0.48 % No SInE strategy applied
% 0.38/0.48 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.38/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.38/0.48 % Preprocessing time : 0.001 s
% 0.38/0.48
% 0.38/0.48 % Proof found!
% 0.38/0.48 % SZS status Theorem
% 0.38/0.48 % SZS output start CNFRefutation
% See solution above
% 0.38/0.48 % Parsed axioms : 15
% 0.38/0.48 % Removed by relevancy pruning/SinE : 0
% 0.38/0.48 % Initial clauses : 19
% 0.38/0.48 % Removed in clause preprocessing : 0
% 0.38/0.48 % Initial clauses in saturation : 19
% 0.38/0.48 % Processed clauses : 329
% 0.38/0.48 % ...of these trivial : 0
% 0.38/0.48 % ...subsumed : 211
% 0.38/0.48 % ...remaining for further processing : 118
% 0.38/0.48 % Other redundant clauses eliminated : 0
% 0.38/0.48 % Clauses deleted for lack of memory : 0
% 0.38/0.48 % Backward-subsumed : 11
% 0.38/0.48 % Backward-rewritten : 0
% 0.38/0.48 % Generated clauses : 1062
% 0.38/0.48 % ...of the previous two non-redundant : 929
% 0.38/0.48 % ...aggressively subsumed : 0
% 0.38/0.48 % Contextual simplify-reflections : 0
% 0.38/0.48 % Paramodulations : 850
% 0.38/0.48 % Factorizations : 212
% 0.38/0.48 % NegExts : 0
% 0.38/0.48 % Equation resolutions : 0
% 0.38/0.48 % Disequality decompositions : 0
% 0.38/0.48 % Total rewrite steps : 133
% 0.38/0.48 % ...of those cached : 126
% 0.38/0.48 % Propositional unsat checks : 0
% 0.38/0.48 % Propositional check models : 0
% 0.38/0.48 % Propositional check unsatisfiable : 0
% 0.38/0.48 % Propositional clauses : 0
% 0.38/0.48 % Propositional clauses after purity: 0
% 0.38/0.48 % Propositional unsat core size : 0
% 0.38/0.48 % Propositional preprocessing time : 0.000
% 0.38/0.48 % Propositional encoding time : 0.000
% 0.38/0.48 % Propositional solver time : 0.000
% 0.38/0.48 % Success case prop preproc time : 0.000
% 0.38/0.48 % Success case prop encoding time : 0.000
% 0.38/0.48 % Success case prop solver time : 0.000
% 0.38/0.48 % Current number of processed clauses : 107
% 0.38/0.48 % Positive orientable unit clauses : 7
% 0.38/0.48 % Positive unorientable unit clauses: 0
% 0.38/0.48 % Negative unit clauses : 5
% 0.38/0.48 % Non-unit-clauses : 95
% 0.38/0.48 % Current number of unprocessed clauses: 606
% 0.38/0.48 % ...number of literals in the above : 4008
% 0.38/0.48 % Current number of archived formulas : 0
% 0.38/0.48 % Current number of archived clauses : 11
% 0.38/0.48 % Clause-clause subsumption calls (NU) : 3152
% 0.38/0.48 % Rec. Clause-clause subsumption calls : 1290
% 0.38/0.48 % Non-unit clause-clause subsumptions : 216
% 0.38/0.48 % Unit Clause-clause subsumption calls : 80
% 0.38/0.48 % Rewrite failures with RHS unbound : 0
% 0.38/0.48 % BW rewrite match attempts : 2
% 0.38/0.48 % BW rewrite match successes : 2
% 0.38/0.48 % Condensation attempts : 0
% 0.38/0.48 % Condensation successes : 0
% 0.38/0.48 % Termbank termtop insertions : 14403
% 0.38/0.48 % Search garbage collected termcells : 221
% 0.38/0.48
% 0.38/0.48 % -------------------------------------------------
% 0.38/0.48 % User time : 0.025 s
% 0.38/0.48 % System time : 0.003 s
% 0.38/0.48 % Total time : 0.028 s
% 0.38/0.48 % Maximum resident set size: 3648 pages
% 0.38/0.48
% 0.38/0.48 % -------------------------------------------------
% 0.38/0.48 % User time : 0.076 s
% 0.38/0.48 % System time : 0.017 s
% 0.38/0.48 % Total time : 0.092 s
% 0.38/0.48 % Maximum resident set size: 4864 pages
% 0.38/0.48 % E exiting
%------------------------------------------------------------------------------