%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO198+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 : n017.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:42 PM UTC 2026
% Result : Theorem 0.23s 0.53s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 39 ~; 46 |; 15 &)
% ( 0 <=>; 8 =>; 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 : 68 ( 0 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( ~ apart_point_and_line(intersection_point(X1,X2),X3)
& convergent_lines(X1,X3)
& convergent_lines(X3,X2)
& convergent_lines(X1,X2) )
=> ~ apart_point_and_line(intersection_point(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).
fof(ceq3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq3) ).
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(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(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(intersection_point(X1,X2),X3)
& convergent_lines(X1,X3)
& convergent_lines(X3,X2)
& convergent_lines(X1,X2) )
=> ~ apart_point_and_line(intersection_point(X1,X3),X2) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2,X3] :
( ( ~ apart_point_and_line(intersection_point(X1,X2),X3)
& convergent_lines(X1,X3)
& convergent_lines(X3,X2)
& convergent_lines(X1,X2) )
=> ~ apart_point_and_line(intersection_point(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X15,X16,X17] :
( convergent_lines(X16,X17)
| convergent_lines(X15,X17)
| ~ convergent_lines(X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])])]) ).
fof(c_0_10,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0)
& ~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(esk3_0,esk2_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_8])])])]) ).
fof(c_0_11,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_12,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X34,X35] :
( distinct_lines(X34,X35)
| ~ convergent_lines(X34,X35) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
fof(c_0_15,plain,
! [X21,X22,X23] :
( ( ~ convergent_lines(X21,X22)
| distinct_points(X23,intersection_point(X21,X22))
| ~ apart_point_and_line(X23,X22) )
& ( ~ convergent_lines(X21,X22)
| distinct_points(X23,intersection_point(X21,X22))
| ~ apart_point_and_line(X23,X21) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])])]) ).
fof(c_0_16,plain,
! [X8] : ~ convergent_lines(X8,X8),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
( convergent_lines(esk3_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X24,X25,X26,X27] :
( apart_point_and_line(X25,X27)
| apart_point_and_line(X25,X26)
| apart_point_and_line(X24,X27)
| apart_point_and_line(X24,X26)
| ~ distinct_lines(X26,X27)
| ~ distinct_points(X24,X25) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_19,plain,
( ~ convergent_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,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_15]) ).
cnf(c_0_21,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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(X1,X2)
| convergent_lines(esk3_0,X2)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,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,esk3_0),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_26,negated_conjecture,
( ~ apart_point_and_line(X1,esk2_0)
| distinct_points(X1,intersection_point(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_28,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_29,negated_conjecture,
( convergent_lines(esk1_0,X1)
| convergent_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ distinct_points(X1,X2)
| apart_point_and_line(X2,esk3_0)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X1,esk3_0)
| apart_point_and_line(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_33,plain,
! [X6] : ~ distinct_points(X6,X6),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_34,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_15]) ).
cnf(c_0_35,negated_conjecture,
( ~ apart_point_and_line(X2,X1)
| distinct_points(X2,intersection_point(esk1_0,X1))
| convergent_lines(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ apart_point_and_line(X2,X1)
| distinct_points(X2,intersection_point(X1,esk3_0))
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( ~ apart_point_and_line(X1,esk1_0)
| distinct_points(X1,intersection_point(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_21]) ).
cnf(c_0_41,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_22]),c_0_37]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO198+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 % Computer : n017.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Sun Sep 20 13:12:58 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.48 Running first-order theorem proving
% 0.23/0.48 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.23/0.53 % Version: 3.5.1
% 0.23/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.53 % Starting sh5l with 300s (1) cores
% 0.23/0.53 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4176307 completed with status 0
% 0.23/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.53 % No SInE strategy applied
% 0.23/0.53 % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.23/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.53 % new_bool_3 with pid 4176314 completed with status 0
% 0.23/0.53 % Result found by new_bool_3
% 0.23/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.53 % No SInE strategy applied
% 0.23/0.53 % Search class: FGUNF-FFSS22-SFFFFFNN
% 0.23/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.23/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.53 % Preprocessing time : 0.002 s
% 0.23/0.53 % Presaturation interreduction done
% 0.23/0.53
% 0.23/0.53 % Proof found!
% 0.23/0.53 % SZS status Theorem
% 0.23/0.53 % SZS output start CNFRefutation
% See solution above
% 0.23/0.53 % Parsed axioms : 13
% 0.23/0.53 % Removed by relevancy pruning/SinE : 0
% 0.23/0.53 % Initial clauses : 19
% 0.23/0.53 % Removed in clause preprocessing : 0
% 0.23/0.53 % Initial clauses in saturation : 19
% 0.23/0.53 % Processed clauses : 201
% 0.23/0.53 % ...of these trivial : 0
% 0.23/0.53 % ...subsumed : 34
% 0.23/0.53 % ...remaining for further processing : 167
% 0.23/0.53 % Other redundant clauses eliminated : 0
% 0.23/0.53 % Clauses deleted for lack of memory : 0
% 0.23/0.53 % Backward-subsumed : 1
% 0.23/0.53 % Backward-rewritten : 1
% 0.23/0.53 % Generated clauses : 574
% 0.23/0.53 % ...of the previous two non-redundant : 404
% 0.23/0.53 % ...aggressively subsumed : 0
% 0.23/0.53 % Contextual simplify-reflections : 0
% 0.23/0.53 % Paramodulations : 538
% 0.23/0.53 % Factorizations : 36
% 0.23/0.53 % NegExts : 0
% 0.23/0.53 % Equation resolutions : 0
% 0.23/0.53 % Disequality decompositions : 0
% 0.23/0.53 % Total rewrite steps : 179
% 0.23/0.53 % ...of those cached : 160
% 0.23/0.53 % Propositional unsat checks : 0
% 0.23/0.53 % Propositional check models : 0
% 0.23/0.53 % Propositional check unsatisfiable : 0
% 0.23/0.53 % Propositional clauses : 0
% 0.23/0.53 % Propositional clauses after purity: 0
% 0.23/0.53 % Propositional unsat core size : 0
% 0.23/0.53 % Propositional preprocessing time : 0.000
% 0.23/0.53 % Propositional encoding time : 0.000
% 0.23/0.53 % Propositional solver time : 0.000
% 0.23/0.53 % Success case prop preproc time : 0.000
% 0.23/0.53 % Success case prop encoding time : 0.000
% 0.23/0.53 % Success case prop solver time : 0.000
% 0.23/0.53 % Current number of processed clauses : 146
% 0.23/0.53 % Positive orientable unit clauses : 28
% 0.23/0.53 % Positive unorientable unit clauses: 0
% 0.23/0.53 % Negative unit clauses : 4
% 0.23/0.53 % Non-unit-clauses : 114
% 0.23/0.53 % Current number of unprocessed clauses: 237
% 0.23/0.53 % ...number of literals in the above : 966
% 0.23/0.53 % Current number of archived formulas : 0
% 0.23/0.53 % Current number of archived clauses : 21
% 0.23/0.53 % Clause-clause subsumption calls (NU) : 757
% 0.23/0.53 % Rec. Clause-clause subsumption calls : 647
% 0.23/0.53 % Non-unit clause-clause subsumptions : 35
% 0.23/0.53 % Unit Clause-clause subsumption calls : 28
% 0.23/0.53 % Rewrite failures with RHS unbound : 0
% 0.23/0.53 % BW rewrite match attempts : 22
% 0.23/0.53 % BW rewrite match successes : 1
% 0.23/0.53 % Condensation attempts : 0
% 0.23/0.53 % Condensation successes : 0
% 0.23/0.53 % Termbank termtop insertions : 9134
% 0.23/0.53 % Search garbage collected termcells : 229
% 0.23/0.53
% 0.23/0.53 % -------------------------------------------------
% 0.23/0.53 % User time : 0.028 s
% 0.23/0.53 % System time : 0.005 s
% 0.23/0.53 % Total time : 0.032 s
% 0.23/0.53 % Maximum resident set size: 3392 pages
% 0.23/0.53
% 0.23/0.53 % -------------------------------------------------
% 0.23/0.53 % User time : 0.126 s
% 0.23/0.53 % System time : 0.020 s
% 0.23/0.53 % Total time : 0.147 s
% 0.23/0.53 % Maximum resident set size: 4864 pages
% 0.23/0.53 % E exiting
%------------------------------------------------------------------------------