%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO208+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n008.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:21 PM UTC 2026
% Result : Theorem 1.70s 6.29s
% Output : CNFRefutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 51 ( 21 ~; 10 |; 13 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 34 !; 6 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1] :
( distinct_lines(X0,X1)
=> convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(f32,axiom,
! [X0,X1] :
( equal_lines(X0,X1)
<=> ~ distinct_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(f33,axiom,
! [X0,X1] :
( parallel_lines(X0,X1)
<=> ~ convergent_lines(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a3) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( ( parallel_lines(X1,X2)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) )
=> equal_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( ( parallel_lines(X1,X2)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X1) )
=> equal_lines(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f39,plain,
! [X0,X1] :
( parallel_lines(X0,X1)
=> ~ convergent_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f33]) ).
fof(f40,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
=> equal_lines(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
fof(f59,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f79,plain,
! [X0,X1] :
( distinct_lines(X0,X1)
| equal_lines(X0,X1) ),
inference(ennf_transformation,[],[f40]) ).
fof(f80,plain,
! [X0,X1] :
( ~ parallel_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f82,plain,
? [X0,X1,X2] :
( parallel_lines(X1,X2)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X1)
& ~ equal_lines(X1,X2) ),
inference(ennf_transformation,[],[f37]) ).
fof(f83,plain,
? [X0,X1,X2] :
( parallel_lines(X1,X2)
& incident_point_and_line(X0,X2)
& incident_point_and_line(X0,X1)
& ~ equal_lines(X1,X2) ),
inference(flattening,[],[f82]) ).
fof(f84,plain,
( parallel_lines(sK1,sK2)
& incident_point_and_line(sK0,sK2)
& incident_point_and_line(sK0,sK1)
& ~ equal_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f83]) ).
fof(f99,plain,
! [X0,X1] :
( ~ distinct_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f121,plain,
! [X0,X1] :
( distinct_lines(X0,X1)
| equal_lines(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f122,plain,
! [X0,X1] :
( ~ parallel_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f80]) ).
fof(f124,plain,
parallel_lines(sK1,sK2),
inference(cnf_transformation,[],[f84]) ).
fof(f127,plain,
~ equal_lines(sK1,sK2),
inference(cnf_transformation,[],[f84]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( equal_lines(X0,X1)
| distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( ~ parallel_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_88,negated_conjecture,
~ equal_lines(sK1,sK2),
inference(cnf_transformation,[],[f127]) ).
tcf(c_91,negated_conjecture,
parallel_lines(sK1,sK2),
inference(cnf_transformation,[],[f124]) ).
tcf(c_308,plain,
distinct_lines(sK1,sK2),
inference(resolution,[status(thm)],[c_85,c_88]) ).
tcf(c_313,plain,
~ convergent_lines(sK1,sK2),
inference(resolution,[status(thm)],[c_86,c_91]) ).
tcf(c_490,plain,
( convergent_lines(sK1,sK2)
| ~ distinct_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_63]) ).
tcf(c_491,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_490,c_313,c_308]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO208+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/5.38 % Computer : n008.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Wed Sep 23 11:30:31 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 1.70/6.29 % SZS status Started for theBenchmark.p
% 1.70/6.29 % SZS status Theorem for theBenchmark.p
% 1.70/6.29
% 1.70/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.70/6.29
% 1.70/6.29 % ------ iProver source info
% 1.70/6.29
% 1.70/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 1.70/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.70/6.29 % git: non_committed_changes: false
% 1.70/6.29
% 1.70/6.29 % ------ Parsing...
% 1.70/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.70/6.29
% 1.70/6.29 % ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.70/6.29
% 1.70/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.70/6.29 % ------ Proving...
% 1.70/6.29 % ------ Problem Properties
% 1.70/6.29
% 1.70/6.29 %
% 1.70/6.29 % clauses 32
% 1.70/6.29 % conjectures 0
% 1.70/6.29 % EPR 24
% 1.70/6.29 % Horn 16
% 1.70/6.29 % unary 11
% 1.70/6.29 % binary 6
% 1.70/6.29 % lits 79
% 1.70/6.29 % lits eq 0
% 1.70/6.29 % fd_pure 0
% 1.70/6.29 % fd_pseudo 0
% 1.70/6.29 % fd_cond 0
% 1.70/6.29 % fd_pseudo_cond 0
% 1.70/6.29 % AC symbols 0
% 1.70/6.29
% 1.70/6.29 % ------ Schedule dynamic 5 is on
% 1.70/6.29
% 1.70/6.29 % ------ no conjectures: strip conj schedule
% 1.70/6.29
% 1.70/6.29 % ------ no equalities: superposition off
% 1.70/6.29
% 1.70/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.70/6.29
% 1.70/6.29
% 1.70/6.29 % ------
% 1.70/6.29 % Current options:
% 1.70/6.29 % ------
% 1.70/6.29
% 1.70/6.29
% 1.70/6.29 %
% 1.70/6.29
% 1.70/6.29 % ------ Proving...
% 1.70/6.29 %
% 1.70/6.29
% 1.70/6.29 % SZS status Theorem for theBenchmark.p
% 1.70/6.29
% 1.70/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.70/6.29
% 1.70/6.29
%------------------------------------------------------------------------------