%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV169+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 : n003.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.18s 0.26s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 122 ( 27 equ)
% Maximal formula atoms : 28 ( 11 avg)
% Number of connectives : 153 ( 42 ~; 37 |; 58 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 29 ( 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n135299)
& leq(X1,n4) )
=> ( ( X0 = pv10
& gt(pv11,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,n135299)
& leq(X3,n4) )
=> ( gt(pv10,X2)
=> a_select3(q_init,X2,X3) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv10)) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0021) ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X0,X1] :
( ( leq(n0,X0)
& leq(n0,X1)
& leq(X0,n135299)
& leq(X1,n4) )
=> ( ( X0 = pv10
& gt(pv11,X1) )
=> a_select3(q_init,X0,X1) = init ) )
& ! [X2,X3] :
( ( leq(n0,X2)
& leq(n0,X3)
& leq(X2,n135299)
& leq(X3,n4) )
=> ( gt(pv10,X2)
=> a_select3(q_init,X2,X3) = init ) )
& ! [X4] :
( ( leq(n0,X4)
& leq(X4,pred(pv10)) )
=> ! [X5] :
( ( leq(n0,X5)
& leq(X5,n4) )
=> a_select3(q_init,X4,X5) = init ) )
& ! [X6] :
( ( leq(n0,X6)
& leq(X6,n4) )
=> a_select3(center_init,X6,n0) = init ) )
=> a_select3(center_init,pv65,n0) = init ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f143,plain,
( init != a_select3(center_init,pv65,n0)
& leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X0,X1] :
( a_select3(q_init,X0,X1) = init
| pv10 != X0
| ~ gt(pv11,X1)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,n135299)
| ~ leq(X1,n4) )
& ! [X2,X3] :
( a_select3(q_init,X2,X3) = init
| ~ gt(pv10,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n135299)
| ~ leq(X3,n4) )
& ! [X4] :
( ! [X5] :
( a_select3(q_init,X4,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv10)) )
& ! [X6] :
( a_select3(center_init,X6,n0) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f144,plain,
( init != a_select3(center_init,pv65,n0)
& leq(n0,pv10)
& leq(n0,pv11)
& leq(n0,pv65)
& leq(pv10,n135299)
& leq(pv11,n4)
& leq(pv65,n4)
& ! [X0,X1] :
( a_select3(q_init,X0,X1) = init
| pv10 != X0
| ~ gt(pv11,X1)
| ~ leq(n0,X0)
| ~ leq(n0,X1)
| ~ leq(X0,n135299)
| ~ leq(X1,n4) )
& ! [X2,X3] :
( a_select3(q_init,X2,X3) = init
| ~ gt(pv10,X2)
| ~ leq(n0,X2)
| ~ leq(n0,X3)
| ~ leq(X2,n135299)
| ~ leq(X3,n4) )
& ! [X4] :
( ! [X5] :
( a_select3(q_init,X4,X5) = init
| ~ leq(n0,X5)
| ~ leq(X5,n4) )
| ~ leq(n0,X4)
| ~ leq(X4,pred(pv10)) )
& ! [X6] :
( a_select3(center_init,X6,n0) = init
| ~ leq(n0,X6)
| ~ leq(X6,n4) ) ),
inference(flattening,[],[f143]) ).
fof(f307,plain,
! [X6] :
( ~ leq(n0,X6)
| init = a_select3(center_init,X6,n0)
| ~ leq(X6,n4) ),
inference(cnf_transformation,[],[f144]) ).
fof(f311,plain,
leq(pv65,n4),
inference(cnf_transformation,[],[f144]) ).
fof(f314,plain,
leq(n0,pv65),
inference(cnf_transformation,[],[f144]) ).
fof(f317,plain,
init != a_select3(center_init,pv65,n0),
inference(cnf_transformation,[],[f144]) ).
fof(f423,plain,
( init = a_select3(center_init,pv65,n0)
| ~ leq(pv65,n4) ),
inference(resolution,[],[f307,f314]) ).
fof(f424,plain,
~ leq(pv65,n4),
inference(forward_subsumption_resolution,[],[f423,f317]) ).
fof(f426,plain,
$false,
inference(forward_subsumption_resolution,[],[f424,f311]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV169+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.08/0.19 % Computer : n003.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 10:05:57 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.18/0.26 % (1485342)Will run a generic schedule for satisfiability detection.
% 0.18/0.26 % (1485349)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3503059201:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.26 % (1485348)% WARNING: option uhcvi not known.
% 0.18/0.26 % (1485349) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1485342-1485349"...
% 0.18/0.26 % (1485349)...printing done.
% 0.18/0.26 % (1485349)Refutation found. Thanks to Tanya!
% 0.18/0.26 % SZS status Theorem for theBenchmark
% 0.18/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.26 % (1485349)------------------------------
% 0.18/0.26 % (1485349)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.26 % (1485349)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.26 % (1485349)CaDiCaL version: 2.1.3
% 0.18/0.26 % (1485349)Termination reason: Refutation
% 0.18/0.26 % (1485349)Time elapsed: 0.004 s
% 0.18/0.26 % (1485349)Peak memory usage: 12 MB
% 0.18/0.26 % (1485349)Instructions burned: 12 (million)
% 0.18/0.26 % (1485342)Success in time 0.035 s
% 0.18/0.26 % Vampire exiting
%------------------------------------------------------------------------------