%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : GEO275+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 : 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:39 PM UTC 2026
% Result : Theorem 3.21s 1.19s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f126ERROR: Could not build tree for root c_2217ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( rcircle(vd1095)
& rcenter(vd1080,vd1095)
& ron(vd1081,vd1095) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(comma_conjunct2(the(228)), 0), and(pred(comma_conjunct1(the(228)), 0), pred(the(228), 0)))') ).
fof(f5,axiom,
! [X0] :
( ( rline(X0)
& ron(vd1080,X0)
& ron(vd1089,X0) )
=> X0 = vskolem1092 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','replace(qu(theu(the(227), 1), imp(the(227))))') ).
fof(f6,axiom,
( rline(vskolem1092)
& ron(vd1080,vskolem1092)
& ron(vd1089,vskolem1092) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','replace(replace(and(pred(s2(plural(the(227))), 0), and(pred(s1(plural(the(227))), 0), pred(the(227), 0)))))') ).
fof(f7,axiom,
vd1080 != vd1081,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','pred(224, 5)') ).
fof(f8,axiom,
? [X0] :
( rpoint(X0)
& vd1081 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s2(plural(224)))') ).
fof(f9,axiom,
? [X0] :
( rpoint(X0)
& vd1080 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(s1(plural(224)))') ).
fof(f127,plain,
? [X0] :
( rcircle(X0)
& rcenter(vd1080,X0)
& ron(vd1081,X0)
& vd1095 != X0 ),
inference(flattening,[],[f126]) ).
fof(f298,plain,
! [X0,X1,X2,X3,X4] :
( ! [X6] :
( ~ rpoint(X6)
| X0 != X6 )
| ! [X5] :
( ~ rpoint(X5)
| X1 != X5 )
| ~ rcenter(X2,X3)
| ~ rcenter(X2,X4)
| ~ ron(X0,X3)
| ~ ron(X1,X4)
| vf(X2,X0) != vf(X2,X1)
| X3 = X4 ),
inference(ennf_transformation,[],[f107]) ).
fof(f299,plain,
! [X0,X1,X2,X3,X4] :
( ! [X6] :
( ~ rpoint(X6)
| X0 != X6 )
| ! [X5] :
( ~ rpoint(X5)
| X1 != X5 )
| ~ rcenter(X2,X3)
| ~ rcenter(X2,X4)
| ~ ron(X0,X3)
| ~ ron(X1,X4)
| vf(X2,X0) != vf(X2,X1)
| X3 = X4 ),
inference(flattening,[],[f298]) ).
fof(f326,plain,
( rcircle(sK1)
& rcenter(vd1080,sK1)
& ron(vd1081,sK1)
& vd1095 != sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f127]) ).
fof(f327,plain,
( rpoint(sK2)
& vd1081 = sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f8]) ).
fof(f328,plain,
( rpoint(sK3)
& vd1080 = sK3 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f9]) ).
fof(f400,plain,
rcenter(vd1080,sK1),
inference(cnf_transformation,[],[f326]) ).
fof(f401,plain,
ron(vd1081,sK1),
inference(cnf_transformation,[],[f326]) ).
fof(f402,plain,
vd1095 != sK1,
inference(cnf_transformation,[],[f326]) ).
fof(f404,plain,
rcenter(vd1080,vd1095),
inference(cnf_transformation,[],[f3]) ).
fof(f405,plain,
ron(vd1081,vd1095),
inference(cnf_transformation,[],[f3]) ).
fof(f412,plain,
rpoint(sK2),
inference(cnf_transformation,[],[f327]) ).
fof(f413,plain,
vd1081 = sK2,
inference(cnf_transformation,[],[f327]) ).
fof(f415,plain,
vd1080 = sK3,
inference(cnf_transformation,[],[f328]) ).
fof(f629,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ rpoint(X6)
| X0 != X6
| ~ rpoint(X5)
| X1 != X5
| ~ rcenter(X2,X3)
| ~ rcenter(X2,X4)
| ~ ron(X0,X3)
| ~ ron(X1,X4)
| vf(X2,X0) != vf(X2,X1)
| X3 = X4 ),
inference(cnf_transformation,[],[f299]) ).
fof(f651,plain,
ron(sK2,sK1),
inference(definition_unfolding,[],[f401,f413]) ).
fof(f652,plain,
rcenter(sK3,sK1),
inference(definition_unfolding,[],[f400,f415]) ).
fof(f653,plain,
ron(sK2,vd1095),
inference(definition_unfolding,[],[f405,f413]) ).
fof(f654,plain,
rcenter(sK3,vd1095),
inference(definition_unfolding,[],[f404,f415]) ).
fof(f1256,plain,
! [X2,X3,X0,X6,X4,X5] :
( ~ rpoint(X6)
| X0 != X6
| ~ rpoint(X5)
| ~ rcenter(X2,X3)
| ~ rcenter(X2,X4)
| ~ ron(X0,X3)
| ~ ron(X5,X4)
| vf(X2,X0) != vf(X2,X5)
| X3 = X4 ),
inference(equality_resolution,[],[f629]) ).
fof(f1257,plain,
! [X2,X3,X6,X4,X5] :
( ~ rpoint(X6)
| ~ rpoint(X5)
| ~ rcenter(X2,X3)
| ~ rcenter(X2,X4)
| ~ ron(X6,X3)
| ~ ron(X5,X4)
| vf(X2,X5) != vf(X2,X6)
| X3 = X4 ),
inference(equality_resolution,[],[f1256]) ).
tcf(c_49,negated_conjecture,
vd1095 != sK1,
inference(cnf_transformation,[],[f402]) ).
tcf(c_50,negated_conjecture,
ron(sK2,sK1),
inference(cnf_transformation,[],[f651]) ).
tcf(c_51,negated_conjecture,
rcenter(sK3,sK1),
inference(cnf_transformation,[],[f652]) ).
tcf(c_53,plain,
ron(sK2,vd1095),
inference(cnf_transformation,[],[f653]) ).
tcf(c_54,plain,
rcenter(sK3,vd1095),
inference(cnf_transformation,[],[f654]) ).
tcf(c_61,plain,
rpoint(sK2),
inference(cnf_transformation,[],[f412]) ).
tcf(c_274,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X3 = X4 )
| ~ rpoint(X2)
| ~ rpoint(X1)
| ~ rcenter(X0,X4)
| ~ rcenter(X0,X3)
| ~ ron(X2,X4)
| ~ ron(X1,X3)
| ( vf(X0,X1) != vf(X0,X2) ) ),
inference(cnf_transformation,[],[f1257]) ).
tcf(c_1206,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X2 )
| ~ rpoint(X0)
| ~ rcenter(X3,X2)
| ~ rcenter(X3,X1)
| ~ ron(X0,X2)
| ~ ron(X0,X1) ),
inference(equality_resolution,[status(thm)],[c_274]) ).
tcf(c_1611,plain,
! [X0: $i,X1: $i] :
( ( X1 = vd1095 )
| ~ rpoint(sK2)
| ~ rcenter(X0,vd1095)
| ~ ron(sK2,X1)
| ~ rcenter(X0,X1) ),
inference(superposition,[status(thm)],[c_53,c_1206]) ).
tcf(c_2204,plain,
! [X0: $i,X1: $i] :
( ( X1 = vd1095 )
| ~ rcenter(X0,X1)
| ~ ron(sK2,X1)
| ~ rcenter(X0,vd1095) ),
inference(global_subsumption_just,[status(thm)],[c_1611,c_61,c_1611]) ).
tcf(c_2205,plain,
! [X0: $i,X1: $i] :
( ( X1 = vd1095 )
| ~ rcenter(X0,vd1095)
| ~ ron(sK2,X1)
| ~ rcenter(X0,X1) ),
inference(renaming,[status(thm)],[c_2204]) ).
tcf(c_2215,plain,
( ( vd1095 = sK1 )
| ~ rcenter(sK3,vd1095)
| ~ ron(sK2,sK1) ),
inference(superposition,[status(thm)],[c_51,c_2205]) ).
tcf(c_2217,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2215,c_49,c_50,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO275+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.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Sep 23 11:50:03 UTC 2026
% 0.14/0.36 % CPUTime :
% 0.14/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.21/1.19 % SZS status Started for theBenchmark.p
% 3.21/1.19 % SZS status Theorem for theBenchmark.p
% 3.21/1.19
% 3.21/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.21/1.19
% 3.21/1.19 % ------ iProver source info
% 3.21/1.19
% 3.21/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.21/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.21/1.19 % git: non_committed_changes: false
% 3.21/1.19
% 3.21/1.19 % ------ Parsing...
% 3.21/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.21/1.19 % ------ Proving...
% 3.21/1.19 % ------ Problem Properties
% 3.21/1.19
% 3.21/1.19 %
% 3.21/1.19 % clauses 247
% 3.21/1.19 % conjectures 4
% 3.21/1.19 % EPR 65
% 3.21/1.19 % Horn 177
% 3.21/1.19 % unary 21
% 3.21/1.19 % binary 32
% 3.21/1.19 % lits 1486
% 3.21/1.19 % lits eq 170
% 3.21/1.19 % fd_pure 0
% 3.21/1.19 % fd_pseudo 0
% 3.21/1.19 % fd_cond 1
% 3.21/1.19 % fd_pseudo_cond 45
% 3.21/1.19 % AC symbols 0
% 3.21/1.19
% 3.21/1.19 % ------ Input Options Time Limit: Unbounded
% 3.21/1.19
% 3.21/1.19
% 3.21/1.19 % ------
% 3.21/1.19 % Current options:
% 3.21/1.19 % ------
% 3.21/1.19
% 3.21/1.19
% 3.21/1.19 %
% 3.21/1.19
% 3.21/1.19 % ------ Proving...
% 3.21/1.19 %
% 3.21/1.19
% 3.21/1.19 % ------ Proving...
% 3.21/1.19 %
% 3.21/1.19
% 3.21/1.19 % ------ Proving...
% 3.21/1.19 %
% 3.21/1.19
% 3.21/1.19 % SZS status Theorem for theBenchmark.p
% 3.21/1.19
% 3.21/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.21/1.19
% 3.21/1.19
%------------------------------------------------------------------------------