%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV166+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n008.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 : Tue Sep 29 01:20:22 PM UTC 2026
% Result : Theorem 0.11s 0.24s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 10 unt; 2 def)
% Number of atoms : 251 ( 66 equ)
% Maximal formula atoms : 36 ( 10 avg)
% Number of connectives : 338 ( 112 ~; 98 |; 98 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 17 con; 0-3 aty)
% Number of variables : 62 ( 0 sgn 59 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,pred(pv40)) )
=> a_select2(mu_init,X3) = init )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv40)) )
=> a_select2(sigma_init,X4) = init )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(center_init,X5,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(muold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(sigmaold_init,X8) = init ) ) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(rhoold_init,X9) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0006) ).
fof(f54,negated_conjecture,
~ ( ( n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X0] :
( ( leq(n0,X0)
& leq(X0,n135299) )
=> ! [X1] :
( ( leq(n0,X1)
& leq(X1,n4) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2] :
( ( leq(n0,X2)
& leq(X2,n4) )
=> a_select2(rho_init,X2) = init )
& ! [X3] :
( ( leq(n0,X3)
& leq(X3,pred(pv40)) )
=> a_select2(mu_init,X3) = init )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv40)) )
=> a_select2(sigma_init,X4) = init )
& ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(center_init,X5,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(muold_init,X6) = init ) )
& ( gt(loopcounter,n1)
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,n4) )
=> a_select2(rhoold_init,X7) = init ) )
& ( gt(loopcounter,n1)
=> ! [X8] :
( ( leq(n0,X8)
& leq(X8,n4) )
=> a_select2(sigmaold_init,X8) = init ) ) )
=> ! [X9] :
( ( leq(n0,X9)
& leq(X9,n4) )
=> a_select2(rhoold_init,X9) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( ? [X9] :
( init != a_select2(rhoold_init,X9)
& leq(n0,X9)
& leq(X9,n4) )
& n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,pred(pv40)) )
& ! [X4] :
( a_select2(sigma_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv40)) )
& ! [X5] :
( a_select3(center_init,X5,n0) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
& ( ! [X6] :
( a_select2(muold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X7] :
( a_select2(rhoold_init,X7) = init
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( a_select2(sigmaold_init,X8) = init
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ? [X9] :
( init != a_select2(rhoold_init,X9)
& leq(n0,X9)
& leq(X9,n4) )
& n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select2(rho_init,X2) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,pred(pv40)) )
& ! [X4] :
( a_select2(sigma_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv40)) )
& ! [X5] :
( a_select3(center_init,X5,n0) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
& ( ! [X6] :
( a_select2(muold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X7] :
( a_select2(rhoold_init,X7) = init
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( a_select2(sigmaold_init,X8) = init
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(flattening,[],[f143]) ).
fof(f197,plain,
( ? [X0] :
( init != a_select2(rhoold_init,X0)
& leq(n0,X0)
& leq(X0,n4) )
& n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ leq(n0,X1)
| ~ leq(X1,n135299) )
& ! [X3] :
( init = a_select2(rho_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ! [X4] :
( init = a_select2(mu_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv40)) )
& ! [X5] :
( init = a_select2(sigma_init,X5)
| ~ leq(n0,X5)
| ~ leq(X5,pred(pv40)) )
& ! [X6] :
( init = a_select3(center_init,X6,n0)
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
& ( ! [X7] :
( init = a_select2(muold_init,X7)
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( init = a_select2(rhoold_init,X8)
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X9] :
( init = a_select2(sigmaold_init,X9)
| ~ leq(n0,X9)
| ~ leq(X9,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(rectify,[],[f144]) ).
fof(f198,plain,
( init != a_select2(rhoold_init,sK31)
& leq(n0,sK31)
& leq(sK31,n4)
& n0 != pv90
& leq(n0,pv40)
& leq(pv40,n4)
& gt(loopcounter,n1)
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ leq(n0,X1)
| ~ leq(X1,n135299) )
& ! [X3] :
( init = a_select2(rho_init,X3)
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ! [X4] :
( init = a_select2(mu_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv40)) )
& ! [X5] :
( init = a_select2(sigma_init,X5)
| ~ leq(n0,X5)
| ~ leq(X5,pred(pv40)) )
& ! [X6] :
( init = a_select3(center_init,X6,n0)
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
& ( ! [X7] :
( init = a_select2(muold_init,X7)
| ~ leq(n0,X7)
| ~ leq(X7,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X8] :
( init = a_select2(rhoold_init,X8)
| ~ leq(n0,X8)
| ~ leq(X8,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X9] :
( init = a_select2(sigmaold_init,X9)
| ~ leq(n0,X9)
| ~ leq(X9,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f197]) ).
fof(f310,plain,
! [X8] :
( init = a_select2(rhoold_init,X8)
| ~ leq(n0,X8)
| ~ leq(X8,n4)
| ~ gt(loopcounter,n1) ),
inference(cnf_transformation,[],[f198]) ).
fof(f317,plain,
gt(loopcounter,n1),
inference(cnf_transformation,[],[f198]) ).
fof(f321,plain,
leq(sK31,n4),
inference(cnf_transformation,[],[f198]) ).
fof(f322,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f198]) ).
fof(f323,plain,
init != a_select2(rhoold_init,sK31),
inference(cnf_transformation,[],[f198]) ).
fof(f395,definition,
( spl32_1
<=> gt(loopcounter,n1) ),
introduced(definition,[new_symbols(definition,[spl32_1])],[avatar_definition]) ).
fof(f403,definition,
( spl32_3
<=> ! [X8] :
( init = a_select2(rhoold_init,X8)
| ~ leq(X8,n4)
| ~ leq(n0,X8) ) ),
introduced(definition,[new_symbols(definition,[spl32_3])],[avatar_definition]) ).
fof(f404,plain,
( ! [X8] :
( ~ leq(n0,X8)
| ~ leq(X8,n4)
| init = a_select2(rhoold_init,X8) )
| ~ spl32_3 ),
inference(avatar_component_clause,[],[f403]) ).
fof(f405,plain,
( ~ spl32_1
| spl32_3 ),
inference(avatar_split_clause,[],[f310,f403,f395]) ).
fof(f410,plain,
spl32_1,
inference(avatar_split_clause,[],[f317,f395]) ).
fof(f420,plain,
( ~ leq(sK31,n4)
| init = a_select2(rhoold_init,sK31)
| ~ spl32_3 ),
inference(resolution,[],[f404,f322]) ).
fof(f421,plain,
( init = a_select2(rhoold_init,sK31)
| ~ spl32_3 ),
inference(forward_subsumption_resolution,[],[f420,f321]) ).
fof(f423,plain,
( $false
| ~ spl32_3 ),
inference(forward_subsumption_resolution,[],[f421,f323]) ).
fof(f424,plain,
~ spl32_3,
inference(avatar_contradiction_clause,[],[f423]) ).
cnf(s2,plain,
( ~ spl32_1
| spl32_3 ),
inference(sat_conversion,[],[f405]) ).
cnf(s4,plain,
spl32_1,
inference(sat_conversion,[],[f410]) ).
cnf(s5,plain,
~ spl32_3,
inference(sat_conversion,[],[f424]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s5,s4]) ).
fof(f425,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV166+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17 % Computer : n008.cluster.edu
% 0.11/0.17 % Model : x86_64 x86_64
% 0.11/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17 % Memory : 8046.5625MB
% 0.11/0.17 % OS : Linux 6.8.0-71-generic
% 0.11/0.17 % CPULimit : 300
% 0.11/0.17 % WCLimit : 300
% 0.11/0.17 % DateTime : Mon Sep 28 10:04:40 UTC 2026
% 0.11/0.17 % CPUTime :
% 0.11/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.20 Running first-order model finding
% 0.11/0.20 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.24 % (2149399)Will run a generic schedule for satisfiability detection.
% 0.11/0.24 % (2149407)dis+10_1_sil=32000:sp=arity:random_seed=1681979017:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.24 % (2149407) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2149399-2149407"...
% 0.11/0.24 % (2149407)...printing done.
% 0.11/0.24 % (2149405)% WARNING: option uhcvi not known.
% 0.11/0.24 % (2149407)Refutation found. Thanks to Tanya!
% 0.11/0.24 % SZS status Theorem for theBenchmark
% 0.11/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.24 % (2149407)------------------------------
% 0.11/0.24 % (2149407)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.24 % (2149407)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.24 % (2149407)CaDiCaL version: 2.1.3
% 0.11/0.24 % (2149407)Termination reason: Refutation
% 0.11/0.24 % (2149407)Time elapsed: 0.004 s
% 0.11/0.24 % (2149407)Peak memory usage: 12 MB
% 0.11/0.24 % (2149407)Instructions burned: 11 (million)
% 0.11/0.24 % (2149399)Success in time 0.031 s
% 0.11/0.25 % Vampire exiting
%------------------------------------------------------------------------------