%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO299+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n005.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:55 PM UTC 2026
% Result : Theorem 3.40s 6.20s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f26ERROR: Could not build tree for root c_419ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rR(vd1201,vd1185,vd1187),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(323, 1254, 0)') ).
fof(f4,axiom,
( rR(vd1187,vd1185,vd1201)
| rR(vd1201,vd1185,vd1187) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(321)') ).
fof(f8,axiom,
! [X0,X1,X2] :
( ( ? [X5] :
( rpoint(X5)
& X0 = X5 )
& ? [X4] :
( rpoint(X4)
& X1 = X4 )
& ? [X3] :
( rpoint(X3)
& X2 = X3 )
& rR(X1,X0,X2) )
=> vplus(vf(X0,X1),vf(X1,X2)) = vf(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(180), 0), imp(cond(axiom(180), 0)))') ).
fof(f9,axiom,
! [X0,X1,X2,X3,X4] :
( ( ? [X7] :
( rpoint(X7)
& X0 = X7 )
& ? [X6] :
( rpoint(X6)
& X1 = X6 )
& ? [X5] :
( rpoint(X5)
& X2 = X5 )
& X0 != X1
& X0 != X2
& X1 != X2
& rline(X4)
& ron(X0,X3)
& ron(X1,X3)
& ron(X2,X3)
& X3 = X4 )
=> ( rR(X2,X0,X1)
| rR(X0,X1,X2)
| rR(X1,X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(axiom(91), 0), imp(cond(axiom(91), 0)))') ).
fof(f10,axiom,
rS(vd1201,vd1187,vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(comma_conjunct2(comma_conjunct2(plural(271))), 1214, 0)') ).
fof(f11,axiom,
ron(vd1187,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s3(plural(315)), 0)') ).
fof(f12,axiom,
( ~ ron(vd1201,vd1232)
=> ( rS(vd1186,vd1201,vd1232)
| rS(vd1200,vd1187,vd1234) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conseq(271), 9), 0)') ).
fof(f13,axiom,
( ~ ron(vd1201,vd1232)
=> ~ rS(vd1200,vd1187,vd1234) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conseq(271), 9), 1)') ).
fof(f14,axiom,
( ~ ron(vd1201,vd1232)
=> ~ rS(vd1186,vd1201,vd1232) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(conseq(271), 9), 2)') ).
fof(f15,axiom,
ron(vd1201,vd1234),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s2(plural(294)), 0)') ).
fof(f16,axiom,
ron(vd1185,vd1234),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s1(plural(294)), 0)') ).
fof(f17,axiom,
rline(vd1234),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(294, 0)') ).
fof(f18,axiom,
ron(vd1187,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s2(plural(293)), 0)') ).
fof(f19,axiom,
ron(vd1185,vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s1(plural(293)), 0)') ).
fof(f20,axiom,
rline(vd1232),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(293, 0)') ).
fof(f21,axiom,
ron(vd1185,vd1197),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','pred(s3(plural(274)), 0)') ).
fof(f22,axiom,
? [X0] :
( rpoint(X0)
& vd1201 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qe(s3(plural(271)))') ).
fof(f167,plain,
! [X0,X1,X2] :
( ! [X5] :
( ~ rpoint(X5)
| X0 != X5 )
| ! [X4] :
( ~ rpoint(X4)
| X1 != X4 )
| ! [X3] :
( ~ rpoint(X3)
| X2 != X3 )
| ~ rR(X1,X0,X2)
| vplus(vf(X0,X1),vf(X1,X2)) = vf(X0,X2) ),
inference(ennf_transformation,[],[f8]) ).
fof(f168,plain,
! [X0,X1,X2] :
( ! [X5] :
( ~ rpoint(X5)
| X0 != X5 )
| ! [X4] :
( ~ rpoint(X4)
| X1 != X4 )
| ! [X3] :
( ~ rpoint(X3)
| X2 != X3 )
| ~ rR(X1,X0,X2)
| vplus(vf(X0,X1),vf(X1,X2)) = vf(X0,X2) ),
inference(flattening,[],[f167]) ).
fof(f175,plain,
( ? [X6] :
( rpoint(X6)
& vd1178 = X6 )
& ? [X5] :
( rpoint(X5)
& vd1179 = X5 )
& ? [X4] :
( rpoint(X4)
& vd1180 = X4 )
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& ? [X3] :
( rpoint(X3)
& vd1185 = X3 )
& ? [X2] :
( rpoint(X2)
& vd1186 = X2 )
& ? [X1] :
( rpoint(X1)
& vd1187 = X1 )
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ! [X0] :
( ~ rline(X0)
| ~ ron(vd1185,X0)
| ~ ron(vd1186,X0)
| ~ ron(vd1187,X0) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f384,plain,
( rpoint(sK1)
& vd1201 = sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f22]) ).
fof(f386,plain,
( rpoint(sK8)
& vd1178 = sK8
& rpoint(sK7)
& vd1179 = sK7
& rpoint(sK6)
& vd1180 = sK6
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& rpoint(sK5)
& vd1185 = sK5
& rpoint(sK4)
& vd1186 = sK4
& rpoint(sK3)
& vd1187 = sK3
& vf(vd1178,vd1179) = vf(vd1185,vd1186)
& vf(vd1178,vd1180) = vf(vd1185,vd1187)
& vangle(vd1179,vd1178,vd1180) = vangle(vd1186,vd1185,vd1187)
& ! [X0] :
( ~ rline(X0)
| ~ ron(vd1185,X0)
| ~ ron(vd1186,X0)
| ~ ron(vd1187,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7,sK8]),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5),skolemize(X4,sK6),skolemize(X5,sK7),skolemize(X6,sK8)],[f175]) ).
fof(f460,plain,
vf(vd1185,vd1187) != vplus(vf(vd1185,vd1201),vf(vd1201,vd1187)),
inference(cnf_transformation,[],[f162]) ).
fof(f461,plain,
rR(vd1201,vd1185,vd1187),
inference(cnf_transformation,[],[f3]) ).
fof(f466,plain,
! [X2,X3,X0,X1,X4,X5] :
( ~ rpoint(X5)
| X0 != X5
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| X2 != X3
| ~ rR(X1,X0,X2)
| vplus(vf(X0,X1),vf(X1,X2)) = vf(X0,X2) ),
inference(cnf_transformation,[],[f168]) ).
fof(f480,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f384]) ).
fof(f481,plain,
vd1201 = sK1,
inference(cnf_transformation,[],[f384]) ).
fof(f495,plain,
rpoint(sK5),
inference(cnf_transformation,[],[f386]) ).
fof(f496,plain,
vd1185 = sK5,
inference(cnf_transformation,[],[f386]) ).
fof(f499,plain,
rpoint(sK3),
inference(cnf_transformation,[],[f386]) ).
fof(f500,plain,
vd1187 = sK3,
inference(cnf_transformation,[],[f386]) ).
fof(f765,plain,
vf(sK5,sK3) != vplus(vf(sK5,sK1),vf(sK1,sK3)),
inference(definition_unfolding,[],[f460,f496,f500,f496,f481,f481,f500]) ).
fof(f766,plain,
rR(sK1,sK5,sK3),
inference(definition_unfolding,[],[f461,f481,f496,f500]) ).
fof(f824,plain,
! [X3,X0,X1,X4,X5] :
( ~ rpoint(X5)
| X0 != X5
| ~ rpoint(X4)
| X1 != X4
| ~ rpoint(X3)
| ~ rR(X1,X0,X3)
| vplus(vf(X0,X1),vf(X1,X3)) = vf(X0,X3) ),
inference(equality_resolution,[],[f466]) ).
fof(f825,plain,
! [X3,X0,X4,X5] :
( ~ rpoint(X5)
| X0 != X5
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rR(X4,X0,X3)
| vf(X0,X3) = vplus(vf(X0,X4),vf(X4,X3)) ),
inference(equality_resolution,[],[f824]) ).
fof(f826,plain,
! [X3,X4,X5] :
( ~ rpoint(X5)
| ~ rpoint(X4)
| ~ rpoint(X3)
| ~ rR(X4,X5,X3)
| vf(X5,X3) = vplus(vf(X5,X4),vf(X4,X3)) ),
inference(equality_resolution,[],[f825]) ).
tcf(c_49,negated_conjecture,
vplus(vf(sK5,sK1),vf(sK1,sK3)) != vf(sK5,sK3),
inference(cnf_transformation,[],[f765]) ).
tcf(c_50,plain,
rR(sK1,sK5,sK3),
inference(cnf_transformation,[],[f766]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( vplus(vf(X1,X0),vf(X0,X2)) = vf(X1,X2) )
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rpoint(X0)
| ~ rR(X0,X1,X2) ),
inference(cnf_transformation,[],[f826]) ).
tcf(c_69,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f480]) ).
tcf(c_77,plain,
rpoint(sK3),
inference(cnf_transformation,[],[f499]) ).
tcf(c_79,plain,
rpoint(sK5),
inference(cnf_transformation,[],[f495]) ).
tcf(c_418,plain,
( ( vplus(vf(sK5,sK1),vf(sK1,sK3)) = vf(sK5,sK3) )
| ~ rpoint(sK1)
| ~ rpoint(sK3)
| ~ rpoint(sK5) ),
inference(superposition,[status(thm)],[c_50,c_55]) ).
tcf(c_419,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_418,c_49,c_69,c_77,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO299+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.36 % Computer : n005.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Wed Sep 23 11:51:23 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/5.41 Running first-order theorem proving
% 0.13/5.41 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/5.42
% 0.13/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.42
% 0.13/5.42 % Detected problem language: tptp
% 0.13/5.43 % Proving...
% 3.40/6.20 % SZS status Started for theBenchmark.p
% 3.40/6.20 % SZS status Theorem for theBenchmark.p
% 3.40/6.20
% 3.40/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.40/6.20
% 3.40/6.20 % ------ iProver source info
% 3.40/6.20
% 3.40/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 3.40/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.40/6.20 % git: non_committed_changes: false
% 3.40/6.20
% 3.40/6.20 % ------ Parsing...
% 3.40/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.40/6.20 % ------ Proving...
% 3.40/6.20 % ------ Problem Properties
% 3.40/6.20
% 3.40/6.20 %
% 3.40/6.20 % clauses 294
% 3.40/6.20 % conjectures 1
% 3.40/6.20 % EPR 96
% 3.40/6.20 % Horn 215
% 3.40/6.20 % unary 55
% 3.40/6.20 % binary 37
% 3.40/6.20 % lits 1577
% 3.40/6.20 % lits eq 200
% 3.40/6.20 % fd_pure 0
% 3.40/6.20 % fd_pseudo 0
% 3.40/6.20 % fd_cond 0
% 3.40/6.20 % fd_pseudo_cond 50
% 3.40/6.20 % AC symbols 0
% 3.40/6.20
% 3.40/6.20 % ------ Input Options Time Limit: Unbounded
% 3.40/6.20
% 3.40/6.20
% 3.40/6.20 % ------
% 3.40/6.20 % Current options:
% 3.40/6.20 % ------
% 3.40/6.20
% 3.40/6.20
% 3.40/6.20 %
% 3.40/6.20
% 3.40/6.20 % ------ Proving...
% 3.40/6.20 %
% 3.40/6.20
% 3.40/6.20 % SZS status Theorem for theBenchmark.p
% 3.40/6.20
% 3.40/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.40/6.20
% 3.40/6.20
%------------------------------------------------------------------------------