%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV175+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 : n019.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:23 PM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 19 unt; 4 def)
% Number of atoms : 186 ( 38 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 208 ( 65 ~; 65 |; 52 &)
% ( 4 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 14 con; 0-3 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [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,pred(pv28)) )
=> 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 ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0051) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [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,pred(pv28)) )
=> 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 ) ) )
=> a_select3(q_init,pv30,pv28) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( init != a_select3(q_init,pv30,pv28)
& leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [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,pred(pv28)) )
& ! [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,
( init != a_select3(q_init,pv30,pv28)
& leq(n0,pv28)
& leq(n0,pv30)
& leq(pv28,n4)
& leq(pv30,n135299)
& ! [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,pred(pv28)) )
& ! [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(f312,plain,
! [X0,X1] :
( a_select3(q_init,X0,X1) = init
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| ~ leq(n0,X0)
| ~ leq(X0,n135299) ),
inference(cnf_transformation,[],[f144]) ).
fof(f313,plain,
leq(pv30,n135299),
inference(cnf_transformation,[],[f144]) ).
fof(f314,plain,
leq(pv28,n4),
inference(cnf_transformation,[],[f144]) ).
fof(f315,plain,
leq(n0,pv30),
inference(cnf_transformation,[],[f144]) ).
fof(f316,plain,
leq(n0,pv28),
inference(cnf_transformation,[],[f144]) ).
fof(f317,plain,
init != a_select3(q_init,pv30,pv28),
inference(cnf_transformation,[],[f144]) ).
fof(f474,plain,
~ leq(n0,pv28),
inference(consistent_polarity_flipping,[],[f316]) ).
fof(f475,plain,
~ leq(n0,pv30),
inference(consistent_polarity_flipping,[],[f315]) ).
fof(f476,plain,
~ leq(pv28,n4),
inference(consistent_polarity_flipping,[],[f314]) ).
fof(f477,plain,
~ leq(pv30,n135299),
inference(consistent_polarity_flipping,[],[f313]) ).
fof(f478,plain,
! [X0,X1] :
( leq(n0,X1)
| a_select3(q_init,X0,X1) = init
| leq(X1,n4)
| leq(n0,X0)
| leq(X0,n135299) ),
inference(consistent_polarity_flipping,[],[f312]) ).
fof(f546,definition,
( spl31_7
<=> leq(pv28,n4) ),
introduced(definition,[new_symbols(definition,[spl31_7])],[avatar_definition]) ).
fof(f548,plain,
( leq(pv28,n4)
| ~ spl31_7 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f554,plain,
( $false
| ~ spl31_7 ),
inference(resolution,[],[f548,f476]) ).
fof(f555,plain,
~ spl31_7,
inference(avatar_contradiction_clause,[],[f554]) ).
fof(f597,plain,
! [X0] :
( init = a_select3(q_init,X0,pv28)
| leq(pv28,n4)
| leq(n0,X0)
| leq(X0,n135299) ),
inference(resolution,[],[f478,f474]) ).
fof(f600,definition,
( spl31_16
<=> ! [X0] :
( init = a_select3(q_init,X0,pv28)
| leq(X0,n135299)
| leq(n0,X0) ) ),
introduced(definition,[new_symbols(definition,[spl31_16])],[avatar_definition]) ).
fof(f601,plain,
( ! [X0] :
( leq(n0,X0)
| leq(X0,n135299)
| init = a_select3(q_init,X0,pv28) )
| ~ spl31_16 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f602,plain,
( spl31_7
| spl31_16 ),
inference(avatar_split_clause,[],[f597,f600,f546]) ).
fof(f604,plain,
( leq(pv30,n135299)
| init = a_select3(q_init,pv30,pv28)
| ~ spl31_16 ),
inference(resolution,[],[f601,f475]) ).
fof(f606,definition,
( spl31_17
<=> init = a_select3(q_init,pv30,pv28) ),
introduced(definition,[new_symbols(definition,[spl31_17])],[avatar_definition]) ).
fof(f608,plain,
( init = a_select3(q_init,pv30,pv28)
| ~ spl31_17 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f610,definition,
( spl31_18
<=> leq(pv30,n135299) ),
introduced(definition,[new_symbols(definition,[spl31_18])],[avatar_definition]) ).
fof(f612,plain,
( leq(pv30,n135299)
| ~ spl31_18 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f613,plain,
( spl31_17
| spl31_18
| ~ spl31_16 ),
inference(avatar_split_clause,[],[f604,f600,f610,f606]) ).
fof(f623,plain,
( init != init
| ~ spl31_17 ),
inference(superposition,[],[f317,f608]) ).
fof(f624,plain,
( $false
| ~ spl31_17 ),
inference(trivial_inequality_removal,[],[f623]) ).
fof(f625,plain,
~ spl31_17,
inference(avatar_contradiction_clause,[],[f624]) ).
fof(f626,plain,
( $false
| ~ spl31_18 ),
inference(resolution,[],[f612,f477]) ).
fof(f627,plain,
~ spl31_18,
inference(avatar_contradiction_clause,[],[f626]) ).
cnf(s6,plain,
~ spl31_7,
inference(sat_conversion,[],[f555]) ).
cnf(s12,plain,
( spl31_7
| spl31_16 ),
inference(sat_conversion,[],[f602]) ).
cnf(s13,plain,
( ~ spl31_16
| spl31_17
| spl31_18 ),
inference(sat_conversion,[],[f613]) ).
cnf(s15,plain,
~ spl31_17,
inference(sat_conversion,[],[f625]) ).
cnf(s16,plain,
~ spl31_18,
inference(sat_conversion,[],[f627]) ).
cnf(s17,plain,
~ spl31_16,
inference(rat,[],[s13,s16,s15]) ).
cnf(s18,plain,
spl31_7,
inference(rat,[],[s12,s17]) ).
cnf(s19,plain,
$false,
inference(rat,[],[s6,s18]) ).
fof(f628,plain,
$false,
inference(avatar_sat_refutation,[],[s19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV175+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n019.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:04:49 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 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.09/0.26 % (3902412)Will run a generic schedule for satisfiability detection.
% 0.09/0.26 % (3902423)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3670704688:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.26 % (3902418)% WARNING: option uhcvi not known.
% 0.09/0.26 % (3902423) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3902412-3902423"...
% 0.09/0.26 % (3902423)...printing done.
% 0.09/0.26 % (3902423)Refutation found. Thanks to Tanya!
% 0.09/0.26 % SZS status Theorem for theBenchmark
% 0.09/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.26 % (3902423)------------------------------
% 0.20/0.26 % (3902423)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.26 % (3902423)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.26 % (3902423)CaDiCaL version: 2.1.3
% 0.20/0.26 % (3902423)Termination reason: Refutation
% 0.20/0.26 % (3902423)Time elapsed: 0.006 s
% 0.20/0.26 % (3902423)Peak memory usage: 13 MB
% 0.20/0.26 % (3902423)Instructions burned: 17 (million)
% 0.20/0.26 % (3902412)Success in time 0.033 s
% 0.20/0.26 % Vampire exiting
%------------------------------------------------------------------------------