%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO219+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n018.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:25 PM UTC 2026
% Result : Theorem 0.44s 1.29s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 7 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 46 ~; 41 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 54 ( 0 sgn 48 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X1,X2)
| convergent_lines(X0,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart6) ).
fof(f13,axiom,
! [X0,X1] :
~ ( ~ unorthogonal_lines(X0,X1)
& ~ convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',coipo1) ).
fof(f14,axiom,
! [X0,X1,X2] :
( ( ( ~ unorthogonal_lines(X0,X2)
| ~ convergent_lines(X0,X2) )
& ( ~ unorthogonal_lines(X0,X1)
| ~ convergent_lines(X0,X1) ) )
=> ( ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',cotno1) ).
fof(f16,conjecture,
! [X0,X1,X2] :
( ( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) )
=> ~ unorthogonal_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f17,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1) )
=> ~ unorthogonal_lines(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(flattening,[],[f22]) ).
fof(f35,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( unorthogonal_lines(X0,X2)
& convergent_lines(X0,X2) )
| ( unorthogonal_lines(X0,X1)
& convergent_lines(X0,X1) )
| ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( unorthogonal_lines(X0,X2)
& convergent_lines(X0,X2) )
| ( unorthogonal_lines(X0,X1)
& convergent_lines(X0,X1) )
| ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(flattening,[],[f36]) ).
fof(f40,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1)
& unorthogonal_lines(X1,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f41,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X0,X2)
& ~ unorthogonal_lines(X0,X1)
& unorthogonal_lines(X1,X2) ),
inference(flattening,[],[f40]) ).
fof(f42,plain,
( ~ convergent_lines(sK0,sK2)
& ~ unorthogonal_lines(sK0,sK1)
& unorthogonal_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f41]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f57,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f59,plain,
! [X2,X0,X1] :
( convergent_lines(X0,X2)
| unorthogonal_lines(X0,X1)
| ~ unorthogonal_lines(X1,X2)
| ~ convergent_lines(X1,X2) ),
inference(cnf_transformation,[],[f37]) ).
fof(f63,plain,
~ convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f42]) ).
fof(f64,plain,
~ unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f42]) ).
fof(f65,plain,
unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f42]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( convergent_lines(X1,X2)
| convergent_lines(X0,X2)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( unorthogonal_lines(X2,X0)
| convergent_lines(X2,X1)
| ~ unorthogonal_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_69,negated_conjecture,
unorthogonal_lines(sK1,sK2),
inference(cnf_transformation,[],[f65]) ).
tcf(c_70,negated_conjecture,
~ unorthogonal_lines(sK0,sK1),
inference(cnf_transformation,[],[f64]) ).
tcf(c_71,negated_conjecture,
~ convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f63]) ).
tcf(c_257,plain,
( unorthogonal_lines(sK0,sK1)
| convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_262,plain,
! [X0: $i] :
( convergent_lines(sK0,X0)
| convergent_lines(sK1,X0)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_269,plain,
! [X0: $i,X1: $i] :
( unorthogonal_lines(X1,sK1)
| convergent_lines(X1,X0)
| ~ unorthogonal_lines(sK1,X0)
| ~ convergent_lines(sK1,X0) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_297,plain,
! [X0: $i] :
( unorthogonal_lines(X0,sK1)
| convergent_lines(X0,sK2)
| ~ unorthogonal_lines(sK1,sK2)
| ~ convergent_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_269]) ).
tcf(c_298,plain,
( unorthogonal_lines(sK0,sK1)
| convergent_lines(sK0,sK2)
| ~ unorthogonal_lines(sK1,sK2)
| ~ convergent_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_297]) ).
tcf(c_316,plain,
( convergent_lines(sK0,sK2)
| convergent_lines(sK1,sK2)
| ~ convergent_lines(sK0,sK1) ),
inference(instantiation,[status(thm)],[c_262]) ).
tcf(c_317,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_316,c_298,c_257,c_70,c_71,c_69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO219+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n018.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 11:34:48 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 0.44/1.29 % SZS status Started for theBenchmark.p
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.29
% 0.44/1.29 % ------ iProver source info
% 0.44/1.29
% 0.44/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.29 % git: non_committed_changes: false
% 0.44/1.29
% 0.44/1.29 % ------ Parsing...
% 0.44/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing... sf_s rm: 9 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing...% ------ preprocesses with Option_epr_non_horn_non_eq
% 0.44/1.29 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.29 % ------ Proving...
% 0.44/1.29 % ------ Problem Properties
% 0.44/1.29
% 0.44/1.29 %
% 0.44/1.29 % clauses 13
% 0.44/1.29 % conjectures 3
% 0.44/1.29 % EPR 13
% 0.44/1.29 % Horn 6
% 0.44/1.29 % unary 5
% 0.44/1.29 % binary 2
% 0.44/1.29 % lits 30
% 0.44/1.29 % lits eq 0
% 0.44/1.29 % fd_pure 0
% 0.44/1.29 % fd_pseudo 0
% 0.44/1.29 % fd_cond 0
% 0.44/1.29 % fd_pseudo_cond 0
% 0.44/1.29 % AC symbols 0
% 0.44/1.29
% 0.44/1.29 % ------ Schedule EPR non Horn non eq is on
% 0.44/1.29
% 0.44/1.29 % ------ no equalities: superposition off
% 0.44/1.29
% 0.44/1.29 % ------ Input Options "--resolution_flag false" Time Limit: 70.
% 0.44/1.29
% 0.44/1.29
% 0.44/1.29 % ------
% 0.44/1.29 % Current options:
% 0.44/1.29 % ------
% 0.44/1.29
% 0.44/1.29
% 0.44/1.29 %
% 0.44/1.29
% 0.44/1.29 % ------ Proving...
% 0.44/1.29 %
% 0.44/1.29
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.29
% 0.44/1.29
%------------------------------------------------------------------------------