%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO184+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 : n006.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:36 PM UTC 2026
% Result : Theorem 0.30s 0.71s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 83 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 89 ( 38 ~; 28 |; 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 : 56 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X2,X4)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_lines(X4,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart1) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X2,X3)
| distinct_points(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart4) ).
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(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X2,X4)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_lines(X4,line_connecting(X1,X2)) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( ~ apart_point_and_line(X2,X4)
& ~ apart_point_and_line(X1,X4)
& convergent_lines(X4,X5)
& distinct_points(X1,X2) )
=> ~ distinct_lines(X4,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
fof(c_0_9,plain,
! [X40,X41,X42] :
( distinct_points(X41,X42)
| distinct_points(X40,X42)
| ~ distinct_points(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])]) ).
fof(c_0_10,negated_conjecture,
( distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0))
& ~ apart_point_and_line(esk2_0,esk3_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_11,plain,
! [X14,X15,X16,X17] :
( apart_point_and_line(X15,X17)
| apart_point_and_line(X15,X16)
| apart_point_and_line(X14,X17)
| apart_point_and_line(X14,X16)
| ~ distinct_lines(X16,X17)
| ~ distinct_points(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
fof(c_0_12,plain,
! [X39] : ~ distinct_points(X39,X39),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
cnf(c_0_13,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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]) ).
cnf(c_0_16,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_11]) ).
cnf(c_0_17,negated_conjecture,
distinct_lines(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_20,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_21,plain,
! [X24,X25] :
( ~ apart_point_and_line(X24,line_connecting(X24,X25))
| ~ distinct_points(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ distinct_points(X2,X1)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
~ apart_point_and_line(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,negated_conjecture,
~ apart_point_and_line(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_26,plain,
! [X26,X27] :
( ~ apart_point_and_line(X27,line_connecting(X26,X27))
| ~ distinct_points(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_27,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_28,negated_conjecture,
( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ apart_point_and_line(X2,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_14])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO184+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.51 % Computer : n006.cluster.edu
% 0.20/0.51 % Model : x86_64 x86_64
% 0.20/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.51 % Memory : 8046.5625MB
% 0.20/0.51 % OS : Linux 6.8.0-71-generic
% 0.20/0.51 % CPULimit : 300
% 0.20/0.51 % WCLimit : 300
% 0.20/0.51 % DateTime : Sun Sep 20 13:07:58 UTC 2026
% 0.07/0.51 % CPUTime :
% 0.07/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.62 Running first-order theorem proving
% 0.07/0.62 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.30/0.71 % Version: 3.5.1
% 0.30/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.71 % Starting sh5l with 300s (1) cores
% 0.30/0.71 % sh5l with pid 640662 completed with status 0
% 0.30/0.71 % Result found by sh5l
% 0.30/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.71 % Starting sh5l with 300s (1) cores
% 0.30/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.71 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.30/0.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.71 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.71 % SubtermCWHack with pid 640670 completed with status 0
% 0.30/0.71 % Result found by SubtermCWHack
% 0.30/0.71 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.71 % Starting sh5l with 300s (1) cores
% 0.30/0.71 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.71 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.71 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.30/0.71 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.71 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.71 % Preprocessing time : 0.002 s
% 0.30/0.71
% 0.30/0.71 % Proof found!
% 0.30/0.71 % SZS status Theorem
% 0.30/0.71 % SZS output start CNFRefutation
% See solution above
% 0.30/0.71 % Parsed axioms : 15
% 0.30/0.71 % Removed by relevancy pruning/SinE : 0
% 0.30/0.71 % Initial clauses : 19
% 0.30/0.71 % Removed in clause preprocessing : 0
% 0.30/0.71 % Initial clauses in saturation : 19
% 0.30/0.71 % Processed clauses : 191
% 0.30/0.71 % ...of these trivial : 0
% 0.30/0.71 % ...subsumed : 98
% 0.30/0.71 % ...remaining for further processing : 93
% 0.30/0.71 % Other redundant clauses eliminated : 0
% 0.30/0.71 % Clauses deleted for lack of memory : 0
% 0.30/0.71 % Backward-subsumed : 10
% 0.30/0.71 % Backward-rewritten : 1
% 0.30/0.71 % Generated clauses : 668
% 0.30/0.71 % ...of the previous two non-redundant : 572
% 0.30/0.71 % ...aggressively subsumed : 0
% 0.30/0.71 % Contextual simplify-reflections : 0
% 0.30/0.71 % Paramodulations : 556
% 0.30/0.71 % Factorizations : 112
% 0.30/0.71 % NegExts : 0
% 0.30/0.71 % Equation resolutions : 0
% 0.30/0.71 % Disequality decompositions : 0
% 0.30/0.71 % Total rewrite steps : 98
% 0.30/0.71 % ...of those cached : 90
% 0.30/0.71 % Propositional unsat checks : 0
% 0.30/0.71 % Propositional check models : 0
% 0.30/0.71 % Propositional check unsatisfiable : 0
% 0.30/0.71 % Propositional clauses : 0
% 0.30/0.71 % Propositional clauses after purity: 0
% 0.30/0.71 % Propositional unsat core size : 0
% 0.30/0.71 % Propositional preprocessing time : 0.000
% 0.30/0.71 % Propositional encoding time : 0.000
% 0.30/0.71 % Propositional solver time : 0.000
% 0.30/0.71 % Success case prop preproc time : 0.000
% 0.30/0.71 % Success case prop encoding time : 0.000
% 0.30/0.71 % Success case prop solver time : 0.000
% 0.30/0.71 % Current number of processed clauses : 82
% 0.30/0.71 % Positive orientable unit clauses : 8
% 0.30/0.71 % Positive unorientable unit clauses: 0
% 0.30/0.71 % Negative unit clauses : 5
% 0.30/0.71 % Non-unit-clauses : 69
% 0.30/0.71 % Current number of unprocessed clauses: 389
% 0.30/0.71 % ...number of literals in the above : 2438
% 0.30/0.71 % Current number of archived formulas : 0
% 0.30/0.71 % Current number of archived clauses : 11
% 0.30/0.71 % Clause-clause subsumption calls (NU) : 1552
% 0.30/0.71 % Rec. Clause-clause subsumption calls : 749
% 0.30/0.71 % Non-unit clause-clause subsumptions : 102
% 0.30/0.71 % Unit Clause-clause subsumption calls : 81
% 0.30/0.71 % Rewrite failures with RHS unbound : 0
% 0.30/0.71 % BW rewrite match attempts : 3
% 0.30/0.71 % BW rewrite match successes : 3
% 0.30/0.71 % Condensation attempts : 0
% 0.30/0.71 % Condensation successes : 0
% 0.30/0.71 % Termbank termtop insertions : 9910
% 0.30/0.71 % Search garbage collected termcells : 223
% 0.30/0.71
% 0.30/0.71 % -------------------------------------------------
% 0.30/0.71 % User time : 0.020 s
% 0.30/0.71 % System time : 0.004 s
% 0.30/0.71 % Total time : 0.024 s
% 0.30/0.71 % Maximum resident set size: 3648 pages
% 0.30/0.71
% 0.30/0.71 % -------------------------------------------------
% 0.30/0.71 % User time : 0.021 s
% 0.30/0.71 % System time : 0.012 s
% 0.30/0.71 % Total time : 0.033 s
% 0.30/0.71 % Maximum resident set size: 4608 pages
% 0.30/0.71 % E exiting
%------------------------------------------------------------------------------