%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV181+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.19s 0.27s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 10 unt; 2 def)
% Number of atoms : 214 ( 43 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 266 ( 88 ~; 82 |; 70 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 64 ( 0 sgn 61 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( ( gt(X0,X1)
& gt(X1,X2) )
=> gt(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
fof(f9,axiom,
! [X0,X1] :
( ( leq(X0,X1)
& X0 != X1 )
=> gt(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(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(muold_init,X6) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0081) ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(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(muold_init,X6) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f103,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X0,X1)
| ~ gt(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f104,plain,
! [X0,X1,X2] :
( gt(X0,X2)
| ~ gt(X0,X1)
| ~ gt(X1,X2) ),
inference(flattening,[],[f103]) ).
fof(f108,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f9]) ).
fof(f109,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f108]) ).
fof(f143,plain,
( ? [X6] :
( init != a_select2(muold_init,X6)
& leq(n0,X6)
& leq(X6,n4) )
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(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(muold_init,X6)
& leq(n0,X6)
& leq(X6,n4) )
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(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(f197,plain,
( ? [X0] :
( init != a_select2(muold_init,X0)
& leq(n0,X0)
& leq(X0,n4) )
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ leq(n0,X1)
| ~ leq(X1,n135299) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( init = a_select2(mu_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X5] :
( init = a_select2(rho_init,X5)
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X6] :
( init = a_select2(sigma_init,X6)
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n0) ) ),
inference(rectify,[],[f144]) ).
fof(f198,plain,
( init != a_select2(muold_init,sK31)
& leq(n0,sK31)
& leq(sK31,n4)
& leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [X1] :
( ! [X2] :
( init = a_select3(q_init,X1,X2)
| ~ leq(n0,X2)
| ~ leq(X2,n4) )
| ~ leq(n0,X1)
| ~ leq(X1,n135299) )
& ! [X3] :
( init = a_select3(center_init,X3,n0)
| ~ leq(n0,X3)
| ~ leq(X3,n4) )
& ( ! [X4] :
( init = a_select2(mu_init,X4)
| ~ leq(n0,X4)
| ~ leq(X4,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X5] :
( init = a_select2(rho_init,X5)
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ gt(loopcounter,n0) )
& ( ! [X6] :
( init = a_select2(sigma_init,X6)
| ~ leq(n0,X6)
| ~ leq(X6,n4) )
| ~ gt(loopcounter,n0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK31]),skolemize(X0,sK31)],[f197]) ).
fof(f200,plain,
! [X2,X0,X1] :
( ~ gt(X1,X2)
| ~ gt(X0,X1)
| gt(X0,X2) ),
inference(cnf_transformation,[],[f104]) ).
fof(f201,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f205,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| gt(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f109]) ).
fof(f314,plain,
gt(n1,loopcounter),
inference(cnf_transformation,[],[f198]) ).
fof(f315,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f198]) ).
fof(f700,plain,
! [X0] :
( ~ gt(X0,n1)
| gt(X0,loopcounter) ),
inference(resolution,[],[f200,f314]) ).
fof(f778,plain,
( gt(loopcounter,n1)
| n1 = loopcounter ),
inference(resolution,[],[f205,f315]) ).
fof(f831,definition,
( spl32_31
<=> n1 = loopcounter ),
introduced(definition,[new_symbols(definition,[spl32_31])],[avatar_definition]) ).
fof(f833,plain,
( n1 = loopcounter
| ~ spl32_31 ),
inference(avatar_component_clause,[],[f831]) ).
fof(f835,definition,
( spl32_32
<=> gt(loopcounter,n1) ),
introduced(definition,[new_symbols(definition,[spl32_32])],[avatar_definition]) ).
fof(f837,plain,
( gt(loopcounter,n1)
| ~ spl32_32 ),
inference(avatar_component_clause,[],[f835]) ).
fof(f838,plain,
( spl32_31
| spl32_32 ),
inference(avatar_split_clause,[],[f778,f835,f831]) ).
fof(f914,plain,
( gt(n1,n1)
| ~ spl32_31 ),
inference(superposition,[],[f314,f833]) ).
fof(f924,plain,
( $false
| ~ spl32_31 ),
inference(forward_subsumption_resolution,[],[f914,f201]) ).
fof(f925,plain,
~ spl32_31,
inference(avatar_contradiction_clause,[],[f924]) ).
fof(f984,plain,
( gt(loopcounter,loopcounter)
| ~ spl32_32 ),
inference(resolution,[],[f700,f837]) ).
fof(f986,plain,
( $false
| ~ spl32_32 ),
inference(forward_subsumption_resolution,[],[f984,f201]) ).
fof(f987,plain,
~ spl32_32,
inference(avatar_contradiction_clause,[],[f986]) ).
cnf(s25,plain,
( spl32_31
| spl32_32 ),
inference(sat_conversion,[],[f838]) ).
cnf(s36,plain,
~ spl32_31,
inference(sat_conversion,[],[f925]) ).
cnf(s37,plain,
~ spl32_32,
inference(sat_conversion,[],[f987]) ).
cnf(s38,plain,
$false,
inference(rat,[],[s25,s37,s36]) ).
fof(f989,plain,
$false,
inference(avatar_sat_refutation,[],[s38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV181+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.08/0.18 % Computer : n026.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 10:10:41 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/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.19/0.27 % (3745787)Will run a generic schedule for satisfiability detection.
% 0.19/0.27 % (3745798)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1826630451:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27 % (3745793)% WARNING: option uhcvi not known.
% 0.19/0.27 % (3745792)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1344318144_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27 % (3745793)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=711698374:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27 % (3745794)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4078181027:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27 % (3745797)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3152639924:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27 % (3745795)dis+10_1_sil=32000:sp=arity:random_seed=2621247123:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27 % (3745796)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=842136800:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27 % (3745795) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3745787-3745795"...
% 0.19/0.27 % (3745795)...printing done.
% 0.19/0.27 % (3745795)Refutation found. Thanks to Tanya!
% 0.19/0.27 % SZS status Theorem for theBenchmark
% 0.19/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27 % (3745795)------------------------------
% 0.19/0.27 % (3745795)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27 % (3745795)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27 % (3745795)CaDiCaL version: 2.1.3
% 0.19/0.27 % (3745795)Termination reason: Refutation
% 0.19/0.27 % (3745795)Time elapsed: 0.020 s
% 0.19/0.27 % (3745795)Peak memory usage: 13 MB
% 0.19/0.27 % (3745795)Instructions burned: 30 (million)
% 0.19/0.27 % (3745787)Success in time 0.055 s
% 0.19/0.27 % Vampire exiting
%------------------------------------------------------------------------------