%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO208+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 : n002.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:20 PM UTC 2026
% Result : Theorem 1.60s 1.27s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 9 unt; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 30 ~; 20 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 ( 0 sgn 22 !; 6 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0,X1,X2] :
( distinct_lines(X1,X2)
=> ( convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cup1) ).
fof(f16,conjecture,
! [X0,X1,X2] :
( ( ~ convergent_lines(X1,X2)
& ~ apart_point_and_line(X0,X2)
& ~ apart_point_and_line(X0,X1) )
=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f17,negated_conjecture,
~ ! [X0,X1,X2] :
( ( ~ convergent_lines(X1,X2)
& ~ apart_point_and_line(X0,X2)
& ~ apart_point_and_line(X0,X1) )
=> ~ distinct_lines(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X1,X2)
& ~ apart_point_and_line(X0,X2)
& ~ apart_point_and_line(X0,X1)
& distinct_lines(X1,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f38,plain,
? [X0,X1,X2] :
( ~ convergent_lines(X1,X2)
& ~ apart_point_and_line(X0,X2)
& ~ apart_point_and_line(X0,X1)
& distinct_lines(X1,X2) ),
inference(flattening,[],[f37]) ).
fof(f39,plain,
( ~ convergent_lines(sK1,sK2)
& ~ apart_point_and_line(sK0,sK2)
& ~ apart_point_and_line(sK0,sK1)
& distinct_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f38]) ).
fof(f56,plain,
! [X2,X0,X1] :
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2)
| apart_point_and_line(X0,X2)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f57,plain,
~ convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f39]) ).
fof(f58,plain,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f39]) ).
fof(f59,plain,
~ apart_point_and_line(sK0,sK1),
inference(cnf_transformation,[],[f39]) ).
fof(f60,plain,
distinct_lines(sK1,sK2),
inference(cnf_transformation,[],[f39]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( apart_point_and_line(X2,X1)
| apart_point_and_line(X2,X0)
| convergent_lines(X0,X1)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_66,negated_conjecture,
distinct_lines(sK1,sK2),
inference(cnf_transformation,[],[f60]) ).
tcf(c_67,negated_conjecture,
~ apart_point_and_line(sK0,sK1),
inference(cnf_transformation,[],[f59]) ).
tcf(c_68,negated_conjecture,
~ apart_point_and_line(sK0,sK2),
inference(cnf_transformation,[],[f58]) ).
tcf(c_69,negated_conjecture,
~ convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f57]) ).
tcf(c_177,plain,
! [X0: $i] :
( convergent_lines(sK1,sK2)
| apart_point_and_line(X0,sK2)
| apart_point_and_line(X0,sK1)
| ~ distinct_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_186,plain,
( apart_point_and_line(sK0,sK2)
| apart_point_and_line(sK0,sK1)
| convergent_lines(sK1,sK2)
| ~ distinct_lines(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_177]) ).
tcf(c_187,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_186,c_67,c_68,c_69,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO208+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.11/0.36 % Computer : n002.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 11:32:05 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.60/1.27 % SZS status Started for theBenchmark.p
% 1.60/1.27 % SZS status Theorem for theBenchmark.p
% 1.60/1.27
% 1.60/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.60/1.27
% 1.60/1.27 % ------ iProver source info
% 1.60/1.27
% 1.60/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.60/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.60/1.27 % git: non_committed_changes: false
% 1.60/1.27
% 1.60/1.27 % ------ Parsing...
% 1.60/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.60/1.27
% 1.60/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.60/1.27
% 1.60/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.60/1.27 % ------ Proving...
% 1.60/1.27 % ------ Problem Properties
% 1.60/1.27
% 1.60/1.27 %
% 1.60/1.27 % clauses 21
% 1.60/1.27 % conjectures 4
% 1.60/1.27 % EPR 15
% 1.60/1.27 % Horn 14
% 1.60/1.27 % unary 9
% 1.60/1.27 % binary 1
% 1.60/1.27 % lits 48
% 1.60/1.27 % lits eq 0
% 1.60/1.27 % fd_pure 0
% 1.60/1.27 % fd_pseudo 0
% 1.60/1.27 % fd_cond 0
% 1.60/1.27 % fd_pseudo_cond 0
% 1.60/1.27 % AC symbols 0
% 1.60/1.27
% 1.60/1.27 % ------ Schedule dynamic 5 is on
% 1.60/1.27
% 1.60/1.27 % ------ no equalities: superposition off
% 1.60/1.27
% 1.60/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.60/1.27
% 1.60/1.27
% 1.60/1.27 % ------
% 1.60/1.27 % Current options:
% 1.60/1.27 % ------
% 1.60/1.27
% 1.60/1.27
% 1.60/1.27 %
% 1.60/1.27
% 1.60/1.27 % ------ Proving...
% 1.60/1.27 %
% 1.60/1.27
% 1.60/1.27 % SZS status Theorem for theBenchmark.p
% 1.60/1.27
% 1.60/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.60/1.28
% 1.60/1.28
%------------------------------------------------------------------------------