%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO263+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:37 PM UTC 2026
% Result : Theorem 1.79s 1.30s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 73 ( 26 ~; 19 |; 23 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 52 !; 12 ?; 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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(f32,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(negated_conjecture,[status(cth)],[f32]) ).
fof(f34,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(f37,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ( unequally_directed_lines(X0,reverse_line(X1))
& unequally_directed_lines(X0,X1) ) ),
inference(ennf_transformation,[],[f34]) ).
fof(f50,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(f51,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,[],[f50]) ).
fof(f53,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,reverse_line(X1))
& ~ left_convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f74,plain,
? [X0,X1,X2,X3,X4,X5] :
( convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5)
& ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(ennf_transformation,[],[f33]) ).
fof(f75,plain,
? [X0,X1,X2,X3,X4,X5] :
( convergent_lines(X1,X2)
& convergent_lines(X0,X2)
& convergent_lines(X0,X1)
& between_on_line(X0,X3,X4,X5)
& ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),intersection_point(X1,parallel_through_point(X2,X4)),intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(flattening,[],[f74]) ).
fof(f80,plain,
( convergent_lines(sK1,sK2)
& convergent_lines(sK0,sK2)
& convergent_lines(sK0,sK1)
& between_on_line(sK0,sK3,sK4,sK5)
& ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),intersection_point(sK1,parallel_through_point(sK2,sK4)),intersection_point(sK1,parallel_through_point(sK2,sK5))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f75]) ).
fof(f83,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f84,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f109,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,[],[f51]) ).
fof(f112,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f53]) ).
fof(f113,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f53]) ).
fof(f133,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f80]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_77,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,[],[f109]) ).
tcf(c_80,plain,
! [X0: $i,X1: $i] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f113]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f112]) ).
tcf(c_101,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f133]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i] : ~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_51,c_80,c_81,c_51,c_52,c_77]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] : ~ convergent_lines(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_52,c_124]) ).
tcf(c_158,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_101,c_129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO263+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n016.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Wed Sep 23 11:49:58 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 1.79/1.30 % SZS status Started for theBenchmark.p
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.79/1.30
% 1.79/1.30 % ------ iProver source info
% 1.79/1.30
% 1.79/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.79/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.79/1.30 % git: non_committed_changes: false
% 1.79/1.30
% 1.79/1.30 % ------ Parsing...
% 1.79/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.79/1.30
% 1.79/1.30 % ------ Preprocessing...%
% 1.79/1.30
% 1.79/1.30 % SZS status Theorem for theBenchmark.p
% 1.79/1.30
% 1.79/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.31
% 1.79/1.31
%------------------------------------------------------------------------------