%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO261+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.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 : Fri Sep 25 01:20:36 PM UTC 2026
% Result : Theorem 1.72s 6.71s
% Output : CNFRefutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 73 ( 31 ~; 19 |; 18 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 60 ( 0 sgn 50 !; 10 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',con_def) ).
fof(f14,axiom,
! [X0,X1] :
( ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) )
=> ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(f16,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(f32,conjecture,
! [X0,X1,X2,X3,X4] :
( ( ~ apart_point_and_line(X3,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) )
=> divides_points(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( ~ apart_point_and_line(X3,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4) )
=> divides_points(X1,X2,X4) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f37,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f40,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f56,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f57,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(flattening,[],[f56]) ).
fof(f59,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f80,plain,
? [X0,X1,X2,X3,X4] :
( ~ apart_point_and_line(X3,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4)
& ~ divides_points(X1,X2,X4) ),
inference(ennf_transformation,[],[f33]) ).
fof(f81,plain,
? [X0,X1,X2,X3,X4] :
( ~ apart_point_and_line(X3,X1)
& convergent_lines(X0,X1)
& between_on_line(X0,X2,X3,X4)
& ~ divides_points(X1,X2,X4) ),
inference(flattening,[],[f80]) ).
fof(f82,plain,
( ~ apart_point_and_line(sK3,sK1)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK2,sK3,sK4)
& ~ divides_points(sK1,sK2,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f81]) ).
fof(f85,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f40]) ).
fof(f86,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
fof(f110,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f113,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f59]) ).
fof(f114,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f59]) ).
fof(f133,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f82]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f110]) ).
tcf(c_79,plain,
! [X0: $i,X1: $i] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f114]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f113]) ).
tcf(c_100,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f133]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] : ~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_51,c_79,c_80,c_51,c_52,c_76]) ).
tcf(c_126,plain,
! [X0: $i,X1: $i] : ~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_52,c_121]) ).
tcf(c_159,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_100,c_126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO261+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.79 % Computer : n004.cluster.edu
% 0.12/5.79 % Model : x86_64 x86_64
% 0.12/5.79 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.79 % Memory : 8046.5625MB
% 0.12/5.79 % OS : Linux 6.8.0-71-generic
% 0.12/5.79 % CPULimit : 300
% 0.12/5.79 % WCLimit : 300
% 0.12/5.79 % DateTime : Wed Sep 23 11:44:59 UTC 2026
% 0.12/5.79 % CPUTime :
% 0.12/5.79 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/5.83 Running first-order theorem proving
% 0.17/5.83 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.85
% 0.17/5.85 % ======== iProver multi-core TPTP/SMT =========
% 0.17/5.85
% 0.17/5.85 % Detected problem language: tptp
% 0.17/5.86 % Proving...
% 1.72/6.71 % SZS status Started for theBenchmark.p
% 1.72/6.71 % SZS status Theorem for theBenchmark.p
% 1.72/6.71
% 1.72/6.71 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.72/6.71
% 1.72/6.71 % ------ iProver source info
% 1.72/6.71
% 1.72/6.71 % git: date: 2026-07-19 20:42:38 +0200
% 1.72/6.71 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.72/6.71 % git: non_committed_changes: false
% 1.72/6.71
% 1.72/6.71 % ------ Parsing...
% 1.72/6.71 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.72/6.71
% 1.72/6.71 % ------ Preprocessing...%
% 1.72/6.71
% 1.72/6.71 % SZS status Theorem for theBenchmark.p
% 1.72/6.71
% 1.72/6.71 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.72/6.71
% 1.72/6.71
%------------------------------------------------------------------------------