%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO176+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n014.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:07 PM UTC 2026
% Result : Theorem 1.66s 1.26s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 75 ( 28 ~; 28 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 31 !; 8 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( ( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0) )
=> distinct_points(X2,intersection_point(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO008+0.ax',con2) ).
fof(f13,conjecture,
! [X0,X1,X2,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1) )
=> distinct_points(X0,intersection_point(X2,X3)) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X0,X1)
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X0,X1)
| ( ~ apart_point_and_line(X2,X1)
& ~ apart_point_and_line(X2,X0) )
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(flattening,[],[f23]) ).
fof(f32,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1)
& ~ distinct_points(X0,intersection_point(X2,X3)) ),
inference(ennf_transformation,[],[f14]) ).
fof(f33,plain,
? [X0,X1,X2,X3] :
( ( apart_point_and_line(X0,X3)
| apart_point_and_line(X0,X2) )
& convergent_lines(X2,X3)
& distinct_points(X0,X1)
& ~ distinct_points(X0,intersection_point(X2,X3)) ),
inference(flattening,[],[f32]) ).
fof(f34,plain,
( ( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) )
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1)
& ~ distinct_points(sK0,intersection_point(sK2,sK3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f33]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X1)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(X2,X0)
| distinct_points(X2,intersection_point(X0,X1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f50,plain,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f34]) ).
fof(f52,plain,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f34]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f44]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i,X2: $i] :
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_63,negated_conjecture,
~ distinct_points(sK0,intersection_point(sK2,sK3)),
inference(cnf_transformation,[],[f52]) ).
tcf(c_65,negated_conjecture,
convergent_lines(sK2,sK3),
inference(cnf_transformation,[],[f50]) ).
tcf(c_66,negated_conjecture,
( apart_point_and_line(sK0,sK3)
| apart_point_and_line(sK0,sK2) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_680,plain,
! [X0: $i] :
( distinct_points(X0,intersection_point(sK2,sK3))
| ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(X0,sK2) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_681,plain,
( distinct_points(sK0,intersection_point(sK2,sK3))
| ~ apart_point_and_line(sK0,sK2)
| ~ convergent_lines(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_680]) ).
tcf(c_717,plain,
! [X0: $i] :
( distinct_points(X0,intersection_point(sK2,sK3))
| ~ convergent_lines(sK2,sK3)
| ~ apart_point_and_line(X0,sK3) ),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_718,plain,
( distinct_points(sK0,intersection_point(sK2,sK3))
| ~ apart_point_and_line(sK0,sK3)
| ~ convergent_lines(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_717]) ).
tcf(c_719,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_718,c_681,c_63,c_66,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO176+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n014.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.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Wed Sep 23 11:17:18 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 1.66/1.26 % SZS status Started for theBenchmark.p
% 1.66/1.26 % SZS status Theorem for theBenchmark.p
% 1.66/1.26
% 1.66/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.66/1.26
% 1.66/1.26 % ------ iProver source info
% 1.66/1.26
% 1.66/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.66/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.66/1.26 % git: non_committed_changes: false
% 1.66/1.26
% 1.66/1.26 % ------ Parsing...
% 1.66/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.66/1.26
% 1.66/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.66/1.26
% 1.66/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.66/1.26
% 1.66/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.66/1.26 % ------ Proving...
% 1.66/1.26 % ------ Problem Properties
% 1.66/1.26
% 1.66/1.26 %
% 1.66/1.26 % clauses 19
% 1.66/1.26 % conjectures 4
% 1.66/1.26 % EPR 14
% 1.66/1.26 % Horn 12
% 1.66/1.26 % unary 7
% 1.66/1.26 % binary 2
% 1.66/1.26 % lits 44
% 1.66/1.26 % lits eq 1
% 1.66/1.26 % fd_pure 0
% 1.66/1.26 % fd_pseudo 0
% 1.66/1.26 % fd_cond 0
% 1.66/1.26 % fd_pseudo_cond 0
% 1.66/1.26 % AC symbols 0
% 1.66/1.26
% 1.66/1.26 % ------ Schedule dynamic 5 is on
% 1.66/1.26
% 1.66/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.66/1.26
% 1.66/1.26
% 1.66/1.26 % ------
% 1.66/1.26 % Current options:
% 1.66/1.26 % ------
% 1.66/1.26
% 1.66/1.26
% 1.66/1.26 %
% 1.66/1.26
% 1.66/1.26 % ------ Proving...
% 1.66/1.26 %
% 1.66/1.26
% 1.66/1.26 % SZS status Theorem for theBenchmark.p
% 1.66/1.26
% 1.66/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.26
% 1.66/1.26
%------------------------------------------------------------------------------