%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO300+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n003.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.36s 1.10s
% Output : CNFRefutation 3.36s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f6ERROR: Could not build tree for root c_411ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
rR(vd1187,vd1185,vd1201),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(330, 1259, 0)') ).
fof(f4,axiom,
~ rR(vd1201,vd1185,vd1187),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','neg(323)') ).
fof(f8,axiom,
? [X0] :
( rpoint(X0)
& vd1201 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s3(plural(271)))') ).
fof(f9,axiom,
( ? [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) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(neg(neg(conjunct2(conjunct2(conjunct2(plural(comma_conjunct2(268))))))), and(holds(conjunct1(conjunct2(conjunct2(plural(comma_conjunct2(268))))), 1194, 0), and(holds(conjunct1(conjunct2(plural(comma_conjunct2(268)))), 1193, 0), and(holds(conjunct1(plural(comma_conjunct2(268))), 1192, 0), and(qe(s3(plural(comma_conjunct2(268)))), and(qe(s2(plural(comma_conjunct2(268)))), and(qe(s1(plural(comma_conjunct2(268)))), and(pred(comma_conjunct1(268), 9), and(pred(comma_conjunct1(268), 8), and(pred(comma_conjunct1(268), 7), and(qe(s3(plural(268))), and(qe(s2(plural(268))), qe(s1(plural(268)))))))))))))))') ).
fof(f10,axiom,
! [X0,X1] :
( ( ? [X3] :
( rpoint(X3)
& X0 = X3 )
& ? [X2] :
( rpoint(X2)
& X1 = X2 ) )
=> ( vf(X0,X1) = v0
<=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(162), 0), imp(cond(axiom(162), 0)))') ).
fof(f11,axiom,
~ rR(vd1185,vd1201,vd1187),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','neg(neg(319))') ).
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(ennf_transformation,[],[f6]) ).
fof(f169,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,[],[f168]) ).
fof(f170,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,[],[f9]) ).
fof(f385,plain,
( rpoint(sK1)
& vd1201 = sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f8]) ).
fof(f386,plain,
( rpoint(sK7)
& vd1178 = sK7
& rpoint(sK6)
& vd1179 = sK6
& rpoint(sK5)
& vd1180 = sK5
& vd1178 != vd1179
& vd1178 != vd1180
& vd1179 != vd1180
& rpoint(sK4)
& vd1185 = sK4
& rpoint(sK3)
& vd1186 = sK3
& rpoint(sK2)
& vd1187 = sK2
& 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,[sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5),skolemize(X5,sK6),skolemize(X6,sK7)],[f170]) ).
fof(f461,plain,
vf(vd1185,vd1201) != vplus(vf(vd1185,vd1187),vf(vd1187,vd1201)),
inference(cnf_transformation,[],[f163]) ).
fof(f462,plain,
rR(vd1187,vd1185,vd1201),
inference(cnf_transformation,[],[f3]) ).
fof(f465,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,[],[f169]) ).
fof(f467,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f385]) ).
fof(f468,plain,
vd1201 = sK1,
inference(cnf_transformation,[],[f385]) ).
fof(f478,plain,
rpoint(sK4),
inference(cnf_transformation,[],[f386]) ).
fof(f479,plain,
vd1185 = sK4,
inference(cnf_transformation,[],[f386]) ).
fof(f482,plain,
rpoint(sK2),
inference(cnf_transformation,[],[f386]) ).
fof(f483,plain,
vd1187 = sK2,
inference(cnf_transformation,[],[f386]) ).
fof(f766,plain,
vf(sK4,sK1) != vplus(vf(sK4,sK2),vf(sK2,sK1)),
inference(definition_unfolding,[],[f461,f479,f468,f479,f483,f483,f468]) ).
fof(f767,plain,
rR(sK2,sK4,sK1),
inference(definition_unfolding,[],[f462,f483,f479,f468]) ).
fof(f826,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,[],[f465]) ).
fof(f827,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,[],[f826]) ).
fof(f828,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,[],[f827]) ).
tcf(c_49,negated_conjecture,
vplus(vf(sK4,sK2),vf(sK2,sK1)) != vf(sK4,sK1),
inference(cnf_transformation,[],[f766]) ).
tcf(c_50,plain,
rR(sK2,sK4,sK1),
inference(cnf_transformation,[],[f767]) ).
tcf(c_53,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,[],[f828]) ).
tcf(c_55,plain,
rpoint(sK1),
inference(cnf_transformation,[],[f467]) ).
tcf(c_60,plain,
rpoint(sK2),
inference(cnf_transformation,[],[f482]) ).
tcf(c_62,plain,
rpoint(sK4),
inference(cnf_transformation,[],[f478]) ).
tcf(c_410,plain,
( ( vplus(vf(sK4,sK2),vf(sK2,sK1)) = vf(sK4,sK1) )
| ~ rpoint(sK2)
| ~ rpoint(sK1)
| ~ rpoint(sK4) ),
inference(superposition,[status(thm)],[c_50,c_53]) ).
tcf(c_411,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_410,c_49,c_55,c_60,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO300+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 11:53:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 3.36/1.10 % SZS status Started for theBenchmark.p
% 3.36/1.10 % SZS status Theorem for theBenchmark.p
% 3.36/1.10
% 3.36/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.36/1.10
% 3.36/1.10 % ------ iProver source info
% 3.36/1.10
% 3.36/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 3.36/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.36/1.10 % git: non_committed_changes: false
% 3.36/1.10
% 3.36/1.10 % ------ Parsing...
% 3.36/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.36/1.10 % ------ Proving...
% 3.36/1.10 % ------ Problem Properties
% 3.36/1.10
% 3.36/1.10 %
% 3.36/1.10 % clauses 295
% 3.36/1.10 % conjectures 1
% 3.36/1.10 % EPR 97
% 3.36/1.10 % Horn 216
% 3.36/1.10 % unary 56
% 3.36/1.10 % binary 37
% 3.36/1.10 % lits 1578
% 3.36/1.10 % lits eq 200
% 3.36/1.10 % fd_pure 0
% 3.36/1.10 % fd_pseudo 0
% 3.36/1.10 % fd_cond 0
% 3.36/1.10 % fd_pseudo_cond 50
% 3.36/1.10 % AC symbols 0
% 3.36/1.10
% 3.36/1.10 % ------ Input Options Time Limit: Unbounded
% 3.36/1.10
% 3.36/1.10
% 3.36/1.10 % ------
% 3.36/1.10 % Current options:
% 3.36/1.10 % ------
% 3.36/1.10
% 3.36/1.10
% 3.36/1.10 %
% 3.36/1.10
% 3.36/1.10 % ------ Proving...
% 3.36/1.10 %
% 3.36/1.10
% 3.36/1.10 % SZS status Theorem for theBenchmark.p
% 3.36/1.10
% 3.36/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.36/1.10
% 3.36/1.10
%------------------------------------------------------------------------------