%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO192+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n011.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:14 PM UTC 2026
% Result : Theorem 2.97s 1.32s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 14 unt; 1 def)
% Number of atoms : 110 ( 1 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 100 ( 46 ~; 38 |; 8 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn 58 !; 6 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0] : ~ distinct_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart2) ).
fof(f5,axiom,
! [X0,X1,X2] :
( distinct_lines(X0,X1)
=> ( distinct_lines(X1,X2)
| distinct_lines(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart5) ).
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(f10,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(f13,axiom,
! [X0,X1,X2] :
( apart_point_and_line(X0,X1)
=> ( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(f36,conjecture,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X1,X2)
& distinct_lines(X0,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( apart_point_and_line(intersection_point(X0,X1),X2)
=> ( distinct_lines(X1,X2)
& distinct_lines(X0,X2) ) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ distinct_lines(X0,X1)
| distinct_lines(X1,X2)
| distinct_lines(X0,X2) ),
inference(ennf_transformation,[],[f5]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ~ distinct_lines(X0,X1)
| distinct_lines(X1,X2)
| distinct_lines(X0,X2) ),
inference(flattening,[],[f40]) ).
fof(f46,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f47,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ),
inference(ennf_transformation,[],[f13]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ),
inference(flattening,[],[f52]) ).
fof(f76,plain,
? [X0,X1,X2] :
( convergent_lines(X0,X1)
& apart_point_and_line(intersection_point(X0,X1),X2)
& ( ~ distinct_lines(X1,X2)
| ~ distinct_lines(X0,X2) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f77,plain,
? [X0,X1,X2] :
( convergent_lines(X0,X1)
& apart_point_and_line(intersection_point(X0,X1),X2)
& ( ~ distinct_lines(X1,X2)
| ~ distinct_lines(X0,X2) ) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
( convergent_lines(sK0,sK1)
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& ( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f77]) ).
fof(f80,plain,
! [X0] : ~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f83,plain,
! [X2,X0,X1] :
( ~ distinct_lines(X0,X1)
| distinct_lines(X1,X2)
| distinct_lines(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
fof(f87,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f88,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f91,plain,
! [X2,X0,X1] :
( ~ apart_point_and_line(X0,X1)
| apart_point_and_line(X0,X2)
| distinct_lines(X1,X2) ),
inference(cnf_transformation,[],[f53]) ).
fof(f115,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f78]) ).
fof(f116,plain,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f78]) ).
fof(f117,plain,
( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_50,plain,
! [X0: $i] : ~ distinct_lines(X0,X0),
inference(cnf_transformation,[],[f80]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( distinct_lines(X1,X2)
| distinct_lines(X0,X2)
| ~ distinct_lines(X0,X1) ),
inference(cnf_transformation,[],[f83]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( ~ convergent_lines(X0,X1)
| ~ apart_point_and_line(intersection_point(X0,X1),X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( apart_point_and_line(X0,X2)
| distinct_lines(X1,X2)
| ~ apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f91]) ).
tcf(c_85,negated_conjecture,
( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_86,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(cnf_transformation,[],[f116]) ).
tcf(c_87,negated_conjecture,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f115]) ).
tcf(c_448,definition,
iPr_def_10 = intersection_point(sK0,sK1),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_449,negated_conjecture,
convergent_lines(sK0,sK1),
inference(demodulation,[status(thm)],[c_87]) ).
tcf(c_450,negated_conjecture,
apart_point_and_line(iPr_def_10,sK2),
inference(demodulation,[status(thm)],[c_86,c_448]) ).
tcf(c_451,negated_conjecture,
( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) ),
inference(demodulation,[status(thm)],[c_85]) ).
tcf(c_1161,plain,
( ~ apart_point_and_line(iPr_def_10,sK0)
| ~ convergent_lines(sK0,sK1) ),
inference(superposition,[status(thm)],[c_448,c_57]) ).
tcf(c_1162,plain,
~ apart_point_and_line(iPr_def_10,sK0),
inference(forward_subsumption_resolution,[status(thm)],[c_1161,c_449]) ).
tcf(c_1167,plain,
( ~ apart_point_and_line(iPr_def_10,sK1)
| ~ convergent_lines(sK0,sK1) ),
inference(superposition,[status(thm)],[c_448,c_58]) ).
tcf(c_1168,plain,
~ apart_point_and_line(iPr_def_10,sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_1167,c_449]) ).
tcf(c_1472,plain,
! [X0: $i] :
( apart_point_and_line(iPr_def_10,X0)
| distinct_lines(sK2,X0) ),
inference(superposition,[status(thm)],[c_450,c_61]) ).
tcf(c_2214,plain,
! [X0: $i,X1: $i] :
( apart_point_and_line(iPr_def_10,X0)
| distinct_lines(sK2,X1)
| distinct_lines(X0,X1) ),
inference(superposition,[status(thm)],[c_1472,c_53]) ).
tcf(c_5274,plain,
( apart_point_and_line(iPr_def_10,sK0)
| distinct_lines(sK2,sK2)
| ~ distinct_lines(sK1,sK2) ),
inference(superposition,[status(thm)],[c_2214,c_451]) ).
tcf(c_5285,plain,
~ distinct_lines(sK1,sK2),
inference(forward_subsumption_resolution,[status(thm)],[c_5274,c_1162,c_50]) ).
tcf(c_5295,plain,
( apart_point_and_line(iPr_def_10,sK1)
| distinct_lines(sK2,sK2) ),
inference(superposition,[status(thm)],[c_2214,c_5285]) ).
tcf(c_5298,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5295,c_1168,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO192+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 % Computer : n011.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Wed Sep 23 11:23:59 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.46 % Proving...
% 2.97/1.32 % SZS status Started for theBenchmark.p
% 2.97/1.32 % SZS status Theorem for theBenchmark.p
% 2.97/1.32
% 2.97/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.97/1.32
% 2.97/1.32 % ------ iProver source info
% 2.97/1.32
% 2.97/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 2.97/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.97/1.32 % git: non_committed_changes: false
% 2.97/1.32
% 2.97/1.32 % ------ Parsing...
% 2.97/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.97/1.32
% 2.97/1.32 % ------ Preprocessing... sf_s rm: 4 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.97/1.32
% 2.97/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.97/1.32
% 2.97/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.97/1.32 % ------ Proving...
% 2.97/1.32 % ------ Problem Properties
% 2.97/1.32
% 2.97/1.32 %
% 2.97/1.32 % clauses 32
% 2.97/1.32 % conjectures 3
% 2.97/1.32 % EPR 23
% 2.97/1.32 % Horn 16
% 2.97/1.32 % unary 10
% 2.97/1.32 % binary 7
% 2.97/1.32 % lits 80
% 2.97/1.32 % lits eq 1
% 2.97/1.32 % fd_pure 0
% 2.97/1.32 % fd_pseudo 0
% 2.97/1.32 % fd_cond 0
% 2.97/1.32 % fd_pseudo_cond 0
% 2.97/1.32 % AC symbols 0
% 2.97/1.32
% 2.97/1.32 % ------ Schedule dynamic 5 is on
% 2.97/1.32
% 2.97/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.97/1.32
% 2.97/1.32
% 2.97/1.32 % ------
% 2.97/1.32 % Current options:
% 2.97/1.32 % ------
% 2.97/1.32
% 2.97/1.32
% 2.97/1.32 %
% 2.97/1.32
% 2.97/1.32 % ------ Proving...
% 2.97/1.32 %
% 2.97/1.32
% 2.97/1.32 % SZS status Theorem for theBenchmark.p
% 2.97/1.32
% 2.97/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.97/1.32
% 2.97/1.32
%------------------------------------------------------------------------------