%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO118+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:19:56 PM UTC 2026
% Result : Theorem 0.07s 17.85s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 11 unt; 0 def)
% Number of atoms : 156 ( 10 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 192 ( 70 ~; 64 |; 50 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 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 : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-4 aty)
% Number of variables : 115 ( 0 sgn 102 !; 13 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
! [X0,X1,X2,X3] :
( between_c(X0,X1,X2,X3)
<=> ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).
fof(f18,axiom,
! [X0,X1,X2,X3] :
( between_o(X0,X1,X2,X3)
<=> ( ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',between_o_defn) ).
fof(f23,axiom,
! [X0,X1,X2,X3] :
( between_o(X3,X0,X1,X2)
<=> ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X0] :
( incident_o(X0,X3)
<=> incident_c(X0,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o3) ).
fof(f28,conjecture,
! [X0,X1,X2] :
( ordered_by(X0,X1,X2)
=> ~ ordered_by(X0,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_5) ).
fof(f29,negated_conjecture,
~ ! [X0,X1,X2] :
( ordered_by(X0,X1,X2)
=> ~ ordered_by(X0,X2,X1) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f30,plain,
! [X0,X1,X2,X3] :
( between_o(X3,X0,X1,X2)
<=> ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( incident_o(X5,X3)
<=> incident_c(X5,X4) ) ) ),
inference(rectify,[],[f23]) ).
fof(f57,plain,
? [X0,X1,X2] :
( ordered_by(X0,X1,X2)
& ordered_by(X0,X2,X1) ),
inference(ennf_transformation,[],[f29]) ).
fof(f86,plain,
! [X0,X1,X2,X3] :
( ( ~ between_c(X0,X1,X2,X3)
| ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 ) )
& ( ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3
| between_c(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f87,plain,
! [X0,X1,X2,X3] :
( ( ~ between_c(X0,X1,X2,X3)
| ( ? [X4] :
( inner_point(X2,X4)
& end_point(X3,X4)
& end_point(X1,X4)
& part_of(X4,X0) )
& X1 != X3 ) )
& ( ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3
| between_c(X0,X1,X2,X3) ) ),
inference(flattening,[],[f86]) ).
fof(f88,plain,
! [X0,X1,X2,X3] :
( ( ~ between_c(X0,X1,X2,X3)
| ( ? [X5] :
( inner_point(X2,X5)
& end_point(X3,X5)
& end_point(X1,X5)
& part_of(X5,X0) )
& X1 != X3 ) )
& ( ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3
| between_c(X0,X1,X2,X3) ) ),
inference(rectify,[],[f87]) ).
fof(f89,plain,
! [X0,X1,X2,X3] :
( ( ~ between_c(X0,X1,X2,X3)
| ( inner_point(X2,sK13(X0,X1,X2,X3))
& end_point(X3,sK13(X0,X1,X2,X3))
& end_point(X1,sK13(X0,X1,X2,X3))
& part_of(sK13(X0,X1,X2,X3),X0)
& X1 != X3 ) )
& ( ! [X4] :
( ~ inner_point(X2,X4)
| ~ end_point(X3,X4)
| ~ end_point(X1,X4)
| ~ part_of(X4,X0) )
| X1 = X3
| between_c(X0,X1,X2,X3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X5,sK13(X0,X1,X2,X3))],[f88]) ).
fof(f90,plain,
! [X0,X1,X2,X3] :
( ( ~ between_o(X0,X1,X2,X3)
| ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) ) )
& ( ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) )
| between_o(X0,X1,X2,X3) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f91,plain,
! [X0,X1,X2,X3] :
( ( ~ between_o(X0,X1,X2,X3)
| ( ordered_by(X0,X2,X1)
& ordered_by(X0,X3,X2) )
| ( ordered_by(X0,X2,X3)
& ordered_by(X0,X1,X2) ) )
& ( ( ( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X3,X2) )
& ( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ) )
| between_o(X0,X1,X2,X3) ) ),
inference(flattening,[],[f90]) ).
fof(f94,plain,
! [X0,X1,X2,X3] :
( ( ~ between_o(X3,X0,X1,X2)
| ? [X4] :
( between_c(X4,X0,X1,X2)
& ! [X5] :
( ( ~ incident_o(X5,X3)
| incident_c(X5,X4) )
& ( ~ incident_c(X5,X4)
| incident_o(X5,X3) ) ) ) )
& ( ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( incident_o(X5,X3)
| incident_c(X5,X4) )
& ( ~ incident_o(X5,X3)
| ~ incident_c(X5,X4) ) ) )
| between_o(X3,X0,X1,X2) ) ),
inference(nnf_transformation,[],[f30]) ).
fof(f95,plain,
! [X0,X1,X2,X3] :
( ( ~ between_o(X3,X0,X1,X2)
| ? [X6] :
( between_c(X6,X0,X1,X2)
& ! [X7] :
( ( ~ incident_o(X7,X3)
| incident_c(X7,X6) )
& ( ~ incident_c(X7,X6)
| incident_o(X7,X3) ) ) ) )
& ( ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ? [X5] :
( ( incident_o(X5,X3)
| incident_c(X5,X4) )
& ( ~ incident_o(X5,X3)
| ~ incident_c(X5,X4) ) ) )
| between_o(X3,X0,X1,X2) ) ),
inference(rectify,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2,X3] :
( ( ~ between_o(X3,X0,X1,X2)
| ( between_c(sK16(X0,X1,X2,X3),X0,X1,X2)
& ! [X7] :
( ( ~ incident_o(X7,X3)
| incident_c(X7,sK16(X0,X1,X2,X3)) )
& ( ~ incident_c(X7,sK16(X0,X1,X2,X3))
| incident_o(X7,X3) ) ) ) )
& ( ! [X4] :
( ~ between_c(X4,X0,X1,X2)
| ( ( incident_o(sK15(X3,X4),X3)
| incident_c(sK15(X3,X4),X4) )
& ( ~ incident_o(sK15(X3,X4),X3)
| ~ incident_c(sK15(X3,X4),X4) ) ) )
| between_o(X3,X0,X1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X5,sK15(X3,X4)),skolemize(X6,sK16(X0,X1,X2,X3))],[f95]) ).
fof(f105,plain,
( ordered_by(sK22,sK23,sK24)
& ordered_by(sK22,sK24,sK23) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK22,sK23,sK24]),skolemize(X0,sK22),skolemize(X1,sK23),skolemize(X2,sK24)],[f57]) ).
fof(f152,plain,
! [X2,X3,X0,X1] :
( ~ between_c(X0,X1,X2,X3)
| X1 != X3 ),
inference(cnf_transformation,[],[f89]) ).
fof(f159,plain,
! [X2,X3,X0,X1] :
( ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2)
| between_o(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f91]) ).
fof(f167,plain,
! [X2,X3,X0,X1] :
( ~ between_o(X3,X0,X1,X2)
| between_c(sK16(X0,X1,X2,X3),X0,X1,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f182,plain,
ordered_by(sK22,sK23,sK24),
inference(cnf_transformation,[],[f105]) ).
fof(f183,plain,
ordered_by(sK22,sK24,sK23),
inference(cnf_transformation,[],[f105]) ).
fof(f188,plain,
! [X2,X3,X0] : ~ between_c(X0,X3,X2,X3),
inference(equality_resolution,[],[f152]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i] : ~ between_c(X0,X1,X2,X1),
inference(cnf_transformation,[],[f188]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( between_o(X0,X1,X2,X3)
| ~ ordered_by(X0,X2,X3)
| ~ ordered_by(X0,X1,X2) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_114,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( between_c(sK16(X1,X2,X3,X0),X1,X2,X3)
| ~ between_o(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_125,negated_conjecture,
ordered_by(sK22,sK24,sK23),
inference(cnf_transformation,[],[f183]) ).
tcf(c_126,negated_conjecture,
ordered_by(sK22,sK23,sK24),
inference(cnf_transformation,[],[f182]) ).
tcf(c_7108,negated_conjecture,
ordered_by(sK22,sK23,sK24),
inference(demodulation,[status(thm)],[c_126]) ).
tcf(c_7109,negated_conjecture,
ordered_by(sK22,sK24,sK23),
inference(demodulation,[status(thm)],[c_125]) ).
tcf(c_10660,plain,
! [X0: $i,X1: $i,X2: $i] : ~ between_o(X0,X1,X2,X1),
inference(superposition,[status(thm)],[c_114,c_92]) ).
tcf(c_10744,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ordered_by(X0,X2,X1)
| ~ ordered_by(X0,X1,X2) ),
inference(superposition,[status(thm)],[c_97,c_10660]) ).
tcf(c_10777,plain,
~ ordered_by(sK22,sK24,sK23),
inference(superposition,[status(thm)],[c_7108,c_10744]) ).
tcf(c_10778,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_10777,c_7109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO118+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/17.18 % Computer : n012.cluster.edu
% 0.04/17.18 % Model : x86_64 x86_64
% 0.04/17.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/17.18 % Memory : 8046.5625MB
% 0.04/17.18 % OS : Linux 6.8.0-71-generic
% 0.04/17.18 % CPULimit : 300
% 0.04/17.18 % WCLimit : 300
% 0.04/17.18 % DateTime : Wed Sep 23 10:58:40 UTC 2026
% 0.04/17.19 % CPUTime :
% 0.04/17.19 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/17.20 Running first-order theorem proving
% 0.07/17.20 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.07/17.21
% 0.07/17.21 % ======== iProver multi-core TPTP/SMT =========
% 0.07/17.21
% 0.07/17.21 % Detected problem language: tptp
% 0.07/17.22 % Proving...
% 0.07/17.85 % SZS status Started for theBenchmark.p
% 0.07/17.85 % SZS status Theorem for theBenchmark.p
% 0.07/17.85
% 0.07/17.85 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.07/17.85
% 0.07/17.85 % ------ iProver source info
% 0.07/17.85
% 0.07/17.85 % git: date: 2026-07-19 20:42:38 +0200
% 0.07/17.85 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.07/17.85 % git: non_committed_changes: false
% 0.07/17.85
% 0.07/17.85 % ------ Parsing...
% 0.07/17.85 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.07/17.85
% 0.07/17.85 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.07/17.85
% 0.07/17.85 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.07/17.85
% 0.07/17.85 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.07/17.85 % ------ Proving...
% 0.07/17.85 % ------ Problem Properties
% 0.07/17.85
% 0.07/17.85 %
% 0.07/17.85 % clauses 77
% 0.07/17.85 % conjectures 2
% 0.07/17.85 % EPR 26
% 0.07/17.85 % Horn 49
% 0.07/17.85 % unary 6
% 0.07/17.85 % binary 28
% 0.07/17.85 % lits 228
% 0.07/17.85 % lits eq 21
% 0.07/17.85 % fd_pure 0
% 0.07/17.85 % fd_pseudo 0
% 0.07/17.85 % fd_cond 0
% 0.07/17.85 % fd_pseudo_cond 16
% 0.07/17.85 % AC symbols 0
% 0.07/17.85
% 0.07/17.85 % ------ Schedule dynamic 5 is on
% 0.07/17.85
% 0.07/17.85 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.07/17.85
% 0.07/17.85
% 0.07/17.85 % ------
% 0.07/17.85 % Current options:
% 0.07/17.85 % ------
% 0.07/17.85
% 0.07/17.85
% 0.07/17.85 %
% 0.07/17.85
% 0.07/17.85 % ------ Proving...
% 0.07/17.85 %
% 0.07/17.85
% 0.07/17.85 % SZS status Theorem for theBenchmark.p
% 0.07/17.85
% 0.07/17.85 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.07/17.85
% 0.07/17.85
%------------------------------------------------------------------------------