%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV182+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 : n026.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:24 PM UTC 2026
% Result : Theorem 0.18s 0.28s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 15 unt; 2 def)
% Number of atoms : 156 ( 35 equ)
% Maximal formula atoms : 25 ( 4 avg)
% Number of connectives : 176 ( 56 ~; 51 |; 44 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 14 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& ! [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_select3(center_init,X2,n0) = init )
& ( gt(loopcounter,n0)
=> ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select2(mu_init,X3) = init ) )
& ( gt(loopcounter,n0)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init ) )
& ( gt(loopcounter,n0)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(sigma_init,X5) = init ) ) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(rho_init,X6) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0086) ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& ! [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_select3(center_init,X2,n0) = init )
& ( gt(loopcounter,n0)
=> ! [X3] :
( ( leq(n0,X3)
& leq(X3,n4) )
=> a_select2(mu_init,X3) = init ) )
& ( gt(loopcounter,n0)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(rho_init,X4) = init ) )
& ( gt(loopcounter,n0)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(sigma_init,X5) = init ) ) )
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(rho_init,X6) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f91,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
fof(f133,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f143,plain,
( ? [X6] :
( init != a_select2(rho_init,X6)
& leq(n0,X6)
& leq(X6,n4) )
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select3(center_init,X2,n0) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ( ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X4] :
( a_select2(rho_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X5] :
( a_select2(sigma_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ? [X6] :
( init != a_select2(rho_init,X6)
& leq(n0,X6)
& leq(X6,n4) )
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& ! [X0] :
( ! [X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4) )
| ~ leq(n0,X0)
| ~ leq(X0,n135299) )
& ! [X2] :
( a_select3(center_init,X2,n0) = init
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
& ( ! [X3] :
( a_select2(mu_init,X3) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X4] :
( a_select2(rho_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X5] :
( a_select2(sigma_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n0) ) ),
inference(flattening,[],[f143]) ).
fof(f285,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f300,plain,
! [X0,X1] :
( ~ leq(succ(X0),X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f317,plain,
! [X4] :
( ~ gt(loopcounter,n0)
| ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select2(rho_init,X4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f319,plain,
leq(sK31,n4),
inference(cnf_transformation,[],[f144]) ).
fof(f320,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f144]) ).
fof(f321,plain,
init != a_select2(rho_init,sK31),
inference(cnf_transformation,[],[f144]) ).
fof(f323,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f144]) ).
fof(f361,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f91]) ).
fof(f384,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(plus(X0,n1),X1) ),
inference(definition_unfolding,[],[f300,f285]) ).
fof(f387,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f361,f285]) ).
fof(f399,definition,
( spl32_2
<=> gt(loopcounter,n0) ),
introduced(definition,[new_symbols(definition,[spl32_2])],[avatar_definition]) ).
fof(f401,plain,
( ~ gt(loopcounter,n0)
| spl32_2 ),
inference(avatar_component_clause,[],[f399]) ).
fof(f404,definition,
( spl32_3
<=> ! [X4] :
( ~ leq(X4,n4)
| init = a_select2(rho_init,X4)
| ~ leq(n0,X4) ) ),
introduced(definition,[new_symbols(definition,[spl32_3])],[avatar_definition]) ).
fof(f405,plain,
( ! [X4] :
( ~ leq(X4,n4)
| ~ leq(n0,X4)
| init = a_select2(rho_init,X4) )
| ~ spl32_3 ),
inference(avatar_component_clause,[],[f404]) ).
fof(f406,plain,
( spl32_3
| ~ spl32_2 ),
inference(avatar_split_clause,[],[f317,f399,f404]) ).
fof(f605,plain,
( ~ leq(plus(n0,n1),loopcounter)
| spl32_2 ),
inference(resolution,[],[f384,f401]) ).
fof(f610,plain,
( ~ leq(n1,loopcounter)
| spl32_2 ),
inference(forward_demodulation,[],[f605,f387]) ).
fof(f611,plain,
( $false
| spl32_2 ),
inference(forward_subsumption_resolution,[],[f610,f323]) ).
fof(f612,plain,
spl32_2,
inference(avatar_contradiction_clause,[],[f611]) ).
fof(f626,plain,
( ~ leq(n0,sK31)
| init = a_select2(rho_init,sK31)
| ~ spl32_3 ),
inference(resolution,[],[f405,f319]) ).
fof(f627,plain,
( init = a_select2(rho_init,sK31)
| ~ spl32_3 ),
inference(forward_subsumption_resolution,[],[f626,f320]) ).
fof(f631,plain,
( $false
| ~ spl32_3 ),
inference(forward_subsumption_resolution,[],[f627,f321]) ).
fof(f632,plain,
~ spl32_3,
inference(avatar_contradiction_clause,[],[f631]) ).
cnf(s2,plain,
( ~ spl32_2
| spl32_3 ),
inference(sat_conversion,[],[f406]) ).
cnf(s10,plain,
spl32_2,
inference(sat_conversion,[],[f612]) ).
cnf(s11,plain,
~ spl32_3,
inference(sat_conversion,[],[f632]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s2,s11,s10]) ).
fof(f633,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV182+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.09/0.18 % Computer : n026.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 10:10:27 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 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.18/0.28 % (3745352)Will run a generic schedule for satisfiability detection.
% 0.18/0.28 % (3745357)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1110591580_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.28 % (3745358)% WARNING: option uhcvi not known.
% 0.18/0.28 % (3745358)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2645459718:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.28 % (3745359)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3250137236:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.28 % (3745362)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4162627466:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.28 % (3745360)dis+10_1_sil=32000:sp=arity:random_seed=765898201:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.28 % (3745361)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3578310923:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.28 % (3745363)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2537069477:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.28 % TRYING [1]
% 0.18/0.28 % TRYING [2]
% 0.18/0.28 % (3745361) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3745352-3745361"...
% 0.18/0.28 % (3745361)...printing done.
% 0.18/0.28 % (3745361)Refutation found. Thanks to Tanya!
% 0.18/0.28 % SZS status Theorem for theBenchmark
% 0.18/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.28 % (3745361)------------------------------
% 0.18/0.28 % (3745361)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.28 % (3745361)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.28 % (3745361)CaDiCaL version: 2.1.3
% 0.18/0.28 % (3745361)Termination reason: Refutation
% 0.18/0.28 % (3745361)Time elapsed: 0.019 s
% 0.18/0.28 % (3745361)Peak memory usage: 13 MB
% 0.18/0.28 % (3745361)Instructions burned: 32 (million)
% 0.18/0.28 % (3745352)Success in time 0.059 s
% 0.18/0.28 % Vampire exiting
%------------------------------------------------------------------------------