%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV188+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:25 PM UTC 2026
% Result : Theorem 0.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 38 unt; 2 def)
% Number of atoms : 186 ( 48 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 186 ( 62 ~; 52 |; 43 &)
% ( 3 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 15 con; 0-3 aty)
% Number of variables : 58 ( 0 sgn 56 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
=> leq(X0,succ(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ) ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
fof(f29,axiom,
! [X0] : plus(X0,n1) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).
fof(f30,axiom,
! [X0] : plus(n1,X0) = succ(X0),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).
fof(f42,axiom,
! [X0,X1] :
( leq(succ(X0),succ(X1))
<=> leq(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_succ) ).
fof(f53,conjecture,
( ( ! [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,n4) )
=> a_select3(center_init,X3,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(muold_init,X4) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) )
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,tptp_minus_1) )
=> a_select2(mu_init,X7) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0116) ).
fof(f54,negated_conjecture,
~ ( ( ! [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,n4) )
=> a_select3(center_init,X3,n0) = init )
& ( gt(loopcounter,n1)
=> ! [X4] :
( ( leq(n0,X4)
& leq(X4,n4) )
=> a_select2(muold_init,X4) = init ) )
& ( gt(loopcounter,n1)
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select2(rhoold_init,X5) = init ) )
& ( gt(loopcounter,n1)
=> ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select2(sigmaold_init,X6) = init ) ) )
=> ! [X7] :
( ( leq(n0,X7)
& leq(X7,tptp_minus_1) )
=> a_select2(mu_init,X7) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f68,axiom,
gt(n1,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gt_1_0) ).
fof(f85,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n0) )
=> X0 = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f91,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f110,plain,
! [X0,X1] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f143,plain,
( ? [X7] :
( init != a_select2(mu_init,X7)
& leq(n0,X7)
& leq(X7,tptp_minus_1) )
& ! [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_select3(center_init,X3,n0) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( a_select2(muold_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X5] :
( a_select2(rhoold_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X6] :
( a_select2(sigmaold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( ? [X7] :
( init != a_select2(mu_init,X7)
& leq(n0,X7)
& leq(X7,tptp_minus_1) )
& ! [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_select3(center_init,X3,n0) = init
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( a_select2(muold_init,X4) = init
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X5] :
( a_select2(rhoold_init,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n1) )
& ( ! [X6] :
( a_select2(sigmaold_init,X6) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n1) ) ),
inference(flattening,[],[f143]) ).
fof(f149,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(ennf_transformation,[],[f85]) ).
fof(f150,plain,
! [X0] :
( X0 = n0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(flattening,[],[f149]) ).
fof(f159,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f167,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(X0,succ(X1)) ),
inference(cnf_transformation,[],[f110]) ).
fof(f284,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f285,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f286,plain,
! [X0] : succ(X0) = plus(n1,X0),
inference(cnf_transformation,[],[f30]) ).
fof(f298,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(succ(X0),succ(X1)) ),
inference(cnf_transformation,[],[f42]) ).
fof(f319,plain,
leq(sK31,tptp_minus_1),
inference(cnf_transformation,[],[f144]) ).
fof(f320,plain,
leq(n0,sK31),
inference(cnf_transformation,[],[f144]) ).
fof(f337,plain,
gt(n1,n0),
inference(cnf_transformation,[],[f68]) ).
fof(f354,plain,
! [X0] :
( ~ leq(X0,n0)
| ~ leq(n0,X0)
| n0 = X0 ),
inference(cnf_transformation,[],[f150]) ).
fof(f360,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f91]) ).
fof(f366,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(X0,plus(X1,n1)) ),
inference(definition_unfolding,[],[f167,f285]) ).
fof(f369,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f284,f285]) ).
fof(f370,plain,
! [X0] : plus(X0,n1) = plus(n1,X0),
inference(definition_unfolding,[],[f286,f285]) ).
fof(f382,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| leq(plus(X0,n1),plus(X1,n1)) ),
inference(definition_unfolding,[],[f298,f285,f285]) ).
fof(f386,plain,
n1 = plus(n0,n1),
inference(definition_unfolding,[],[f360,f285]) ).
fof(f394,plain,
! [X0] : gt(X0,X0),
inference(consistent_polarity_flipping,[],[f159]) ).
fof(f419,plain,
~ gt(n1,n0),
inference(consistent_polarity_flipping,[],[f337]) ).
fof(f550,definition,
( spl32_13
<=> leq(n0,n1) ),
introduced(definition,[new_symbols(definition,[spl32_13])],[avatar_definition]) ).
fof(f562,plain,
leq(sK31,plus(tptp_minus_1,n1)),
inference(resolution,[],[f366,f319]) ).
fof(f563,plain,
leq(sK31,n0),
inference(forward_demodulation,[],[f562,f369]) ).
fof(f570,plain,
leq(sK31,plus(n0,n1)),
inference(resolution,[],[f563,f366]) ).
fof(f571,plain,
leq(sK31,n1),
inference(forward_demodulation,[],[f570,f386]) ).
fof(f612,plain,
( ~ leq(n0,sK31)
| n0 = sK31 ),
inference(resolution,[],[f354,f563]) ).
fof(f613,plain,
n0 = sK31,
inference(forward_subsumption_resolution,[],[f612,f320]) ).
fof(f655,plain,
leq(n0,n1),
inference(superposition,[],[f571,f613]) ).
fof(f656,plain,
spl32_13,
inference(avatar_split_clause,[],[f655,f550]) ).
fof(f728,plain,
leq(plus(sK31,n1),plus(tptp_minus_1,n1)),
inference(resolution,[],[f382,f319]) ).
fof(f733,plain,
leq(plus(sK31,n1),n0),
inference(forward_demodulation,[],[f728,f369]) ).
fof(f741,plain,
leq(plus(n1,sK31),n0),
inference(forward_demodulation,[],[f733,f370]) ).
fof(f747,plain,
leq(plus(n1,n0),n0),
inference(forward_demodulation,[],[f741,f613]) ).
fof(f751,plain,
leq(plus(n0,n1),n0),
inference(forward_demodulation,[],[f747,f370]) ).
fof(f754,plain,
leq(n1,n0),
inference(forward_demodulation,[],[f751,f386]) ).
fof(f757,plain,
( ~ leq(n0,n1)
| n0 = n1 ),
inference(resolution,[],[f754,f354]) ).
fof(f764,definition,
( spl32_18
<=> n0 = n1 ),
introduced(definition,[new_symbols(definition,[spl32_18])],[avatar_definition]) ).
fof(f766,plain,
( n0 = n1
| ~ spl32_18 ),
inference(avatar_component_clause,[],[f764]) ).
fof(f767,plain,
( spl32_18
| ~ spl32_13 ),
inference(avatar_split_clause,[],[f757,f550,f764]) ).
fof(f793,plain,
( ~ gt(n0,n0)
| ~ spl32_18 ),
inference(superposition,[],[f419,f766]) ).
fof(f807,plain,
( $false
| ~ spl32_18 ),
inference(forward_subsumption_resolution,[],[f793,f394]) ).
fof(f808,plain,
~ spl32_18,
inference(avatar_contradiction_clause,[],[f807]) ).
cnf(s13,plain,
spl32_13,
inference(sat_conversion,[],[f656]) ).
cnf(s19,plain,
( ~ spl32_13
| spl32_18 ),
inference(sat_conversion,[],[f767]) ).
cnf(s20,plain,
~ spl32_18,
inference(sat_conversion,[],[f808]) ).
cnf(s21,plain,
~ spl32_13,
inference(rat,[],[s19,s20]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s13,s21]) ).
fof(f809,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV188+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n004.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:08:07 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/0.21 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.28 % (258053)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (258058)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2986152917_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % (258059)% WARNING: option uhcvi not known.
% 0.20/0.28 % (258059)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=610637180:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (258060)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1043114226:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (258061)dis+10_1_sil=32000:sp=arity:random_seed=63232324:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (258064)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3629244831:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (258062)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1938712456:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (258063)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=176066594:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % TRYING [1]
% 0.20/0.28 % TRYING [2]
% 0.20/0.28 % (258059) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-258053-258059"...
% 0.20/0.28 % (258059)...printing done.
% 0.20/0.28 % (258059)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (258059)------------------------------
% 0.20/0.28 % (258059)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (258059)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (258059)CaDiCaL version: 2.1.3
% 0.20/0.28 % (258059)Termination reason: Refutation
% 0.20/0.28 % (258059)Time elapsed: 0.016 s
% 0.20/0.28 % (258059)Peak memory usage: 13 MB
% 0.20/0.28 % (258059)Instructions burned: 24 (million)
% 0.20/0.28 % (258053)Success in time 0.059 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------