%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO226+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:53 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 2 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 21 ~; 7 |; 13 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 19 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X8,X9] :
( ( convergent_lines(X8,X9)
& line(X9)
& line(X8) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X9)
& ~ apart_point_and_line(X1,X8) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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(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(c_0_3,negated_conjecture,
~ ! [X8,X9] :
( ( convergent_lines(X8,X9)
& line(X9)
& line(X8) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X9)
& ~ apart_point_and_line(X1,X8) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_4,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_5,negated_conjecture,
~ ! [X8,X9] :
( ( convergent_lines(X8,X9)
& line(X9)
& line(X8) )
=> ? [X1] :
( point(X1)
=> ( ~ apart_point_and_line(X1,X9)
& ~ apart_point_and_line(X1,X8) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_7,plain,
! [X26,X27] :
( ~ apart_point_and_line(intersection_point(X26,X27),X26)
| ~ convergent_lines(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,negated_conjecture,
! [X53] :
( ( apart_point_and_line(X53,esk2_0)
| apart_point_and_line(X53,esk1_0) )
& point(X53)
& convergent_lines(esk1_0,esk2_0)
& line(esk2_0)
& line(esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_9,plain,
! [X28,X29] :
( ~ apart_point_and_line(intersection_point(X28,X29),X29)
| ~ convergent_lines(X28,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_10,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( apart_point_and_line(X1,esk2_0)
| apart_point_and_line(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( ~ convergent_lines(esk1_0,X1)
| apart_point_and_line(intersection_point(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO226+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n019.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 14:01:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 343184 completed with status 0
% 0.13/0.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.13/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 343190 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.42 % No SInE strategy applied
% 0.13/0.42 % Search class: FGHNF-FFSS22-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 19
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 23
% 0.13/0.42 % Removed in clause preprocessing : 2
% 0.13/0.42 % Initial clauses in saturation : 21
% 0.13/0.42 % Processed clauses : 18
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 0
% 0.13/0.42 % ...remaining for further processing : 18
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 4
% 0.13/0.42 % ...of the previous two non-redundant : 3
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 4
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 1
% 0.13/0.42 % ...of those cached : 0
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 18
% 0.13/0.42 % Positive orientable unit clauses : 3
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 4
% 0.13/0.42 % Non-unit-clauses : 11
% 0.13/0.42 % Current number of unprocessed clauses: 6
% 0.13/0.42 % ...number of literals in the above : 21
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 1
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 14
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 14
% 0.13/0.42 % Non-unit clause-clause subsumptions : 0
% 0.13/0.42 % Unit Clause-clause subsumption calls : 4
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 0
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 1753
% 0.13/0.42 % Search garbage collected termcells : 302
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.005 s
% 0.13/0.42 % System time : 0.003 s
% 0.13/0.42 % Total time : 0.008 s
% 0.13/0.42 % Maximum resident set size: 3656 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.010 s
% 0.13/0.42 % System time : 0.011 s
% 0.13/0.42 % Total time : 0.021 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------