%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : HWV095+1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n002.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 11:23:16 AM UTC 2026
% Result : Theorem 0.17s 0.53s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 48 ( 7 unt; 0 def)
% Number of atoms : 120 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 116 ( 44 ~; 35 |; 19 &)
% ( 10 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 45 ( 44 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,conjecture,
! [X0] :
( reachableState(X0)
=> v4(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( reachableState(X0)
=> v4(X0) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f37,axiom,
! [X0] :
( ~ v4(X0)
<=> v995(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
fof(f38,axiom,
! [X0] :
( ~ v995(X0)
<=> v996(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
fof(f39,axiom,
! [X0] :
( v996(X0)
<=> ( v998(X0)
& v1010(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(f40,axiom,
! [X0] :
( v1010(X0)
<=> ( v1000(X0,bitIndex0)
| v1000(X0,bitIndex1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
fof(f41,axiom,
! [X0] :
( ~ v998(X0)
<=> v999(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
fof(f42,axiom,
! [X0] :
( v999(X0)
<=> ( v1000(X0,bitIndex0)
& v1000(X0,bitIndex1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
fof(f43,axiom,
! [X0] :
( v1000(X0,bitIndex0)
<=> v1001(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_245) ).
fof(f44,axiom,
! [X0] :
( v1000(X0,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_244) ).
fof(f45,axiom,
! [X0] :
( v1001(X0)
<=> ( v1003(X0)
& v1007(X0,bitIndex5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
fof(f46,axiom,
! [X0] :
( v1003(X0)
<=> ( v1004(X0)
& v1007(X0,bitIndex4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_77) ).
fof(f52,axiom,
! [X0] : ~ v1007(X0,bitIndex4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_4) ).
fof(f1158,plain,
! [X0] : v1000(X0,bitIndex1),
inference(true_and_false_elimination,[],[f44]) ).
fof(f1381,plain,
! [X0] :
( ~ v4(X0)
=> v995(X0) ),
inference(unused_predicate_definition_removal,[],[f37]) ).
fof(f1382,plain,
! [X0] :
( v996(X0)
=> ~ v995(X0) ),
inference(unused_predicate_definition_removal,[],[f38]) ).
fof(f1383,plain,
! [X0] :
( ( v998(X0)
& v1010(X0) )
=> v996(X0) ),
inference(unused_predicate_definition_removal,[],[f39]) ).
fof(f1384,plain,
! [X0] :
( ~ v998(X0)
=> v999(X0) ),
inference(unused_predicate_definition_removal,[],[f41]) ).
fof(f1385,plain,
! [X0] :
( v999(X0)
=> ( v1000(X0,bitIndex0)
& v1000(X0,bitIndex1) ) ),
inference(unused_predicate_definition_removal,[],[f42]) ).
fof(f1386,plain,
! [X0] :
( ( v1000(X0,bitIndex0)
| v1000(X0,bitIndex1) )
=> v1010(X0) ),
inference(unused_predicate_definition_removal,[],[f40]) ).
fof(f1562,plain,
? [X0] :
( ~ v4(X0)
& reachableState(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f1563,plain,
! [X0] :
( v995(X0)
| v4(X0) ),
inference(ennf_transformation,[],[f1381]) ).
fof(f1564,plain,
! [X0] :
( ~ v995(X0)
| ~ v996(X0) ),
inference(ennf_transformation,[],[f1382]) ).
fof(f1565,plain,
! [X0] :
( v996(X0)
| ~ v998(X0)
| ~ v1010(X0) ),
inference(ennf_transformation,[],[f1383]) ).
fof(f1566,plain,
! [X0] :
( v996(X0)
| ~ v998(X0)
| ~ v1010(X0) ),
inference(flattening,[],[f1565]) ).
fof(f1567,plain,
! [X0] :
( v1010(X0)
| ( ~ v1000(X0,bitIndex0)
& ~ v1000(X0,bitIndex1) ) ),
inference(ennf_transformation,[],[f1386]) ).
fof(f1568,plain,
! [X0] :
( v999(X0)
| v998(X0) ),
inference(ennf_transformation,[],[f1384]) ).
fof(f1569,plain,
! [X0] :
( ( v1000(X0,bitIndex0)
& v1000(X0,bitIndex1) )
| ~ v999(X0) ),
inference(ennf_transformation,[],[f1385]) ).
fof(f2241,plain,
( ~ v4(sK391)
& reachableState(sK391) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK391]),skolemize(X0,sK391)],[f1562]) ).
fof(f2242,plain,
! [X0] :
( ( v1000(X0,bitIndex0)
| ~ v1001(X0) )
& ( v1001(X0)
| ~ v1000(X0,bitIndex0) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f2243,plain,
! [X0] :
( ( v1001(X0)
| ~ v1003(X0)
| ~ v1007(X0,bitIndex5) )
& ( ( v1003(X0)
& v1007(X0,bitIndex5) )
| ~ v1001(X0) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f2244,plain,
! [X0] :
( ( v1001(X0)
| ~ v1003(X0)
| ~ v1007(X0,bitIndex5) )
& ( ( v1003(X0)
& v1007(X0,bitIndex5) )
| ~ v1001(X0) ) ),
inference(flattening,[],[f2243]) ).
fof(f2245,plain,
! [X0] :
( ( v1003(X0)
| ~ v1004(X0)
| ~ v1007(X0,bitIndex4) )
& ( ( v1004(X0)
& v1007(X0,bitIndex4) )
| ~ v1003(X0) ) ),
inference(nnf_transformation,[],[f46]) ).
fof(f2246,plain,
! [X0] :
( ( v1003(X0)
| ~ v1004(X0)
| ~ v1007(X0,bitIndex4) )
& ( ( v1004(X0)
& v1007(X0,bitIndex4) )
| ~ v1003(X0) ) ),
inference(flattening,[],[f2245]) ).
fof(f4020,plain,
~ v4(sK391),
inference(cnf_transformation,[],[f2241]) ).
fof(f4021,plain,
! [X0] :
( v995(X0)
| v4(X0) ),
inference(cnf_transformation,[],[f1563]) ).
fof(f4022,plain,
! [X0] :
( ~ v995(X0)
| ~ v996(X0) ),
inference(cnf_transformation,[],[f1564]) ).
fof(f4023,plain,
! [X0] :
( v996(X0)
| ~ v998(X0)
| ~ v1010(X0) ),
inference(cnf_transformation,[],[f1566]) ).
fof(f4024,plain,
! [X0] :
( v1010(X0)
| ~ v1000(X0,bitIndex1) ),
inference(cnf_transformation,[],[f1567]) ).
fof(f4026,plain,
! [X0] :
( v999(X0)
| v998(X0) ),
inference(cnf_transformation,[],[f1568]) ).
fof(f4028,plain,
! [X0] :
( v1000(X0,bitIndex0)
| ~ v999(X0) ),
inference(cnf_transformation,[],[f1569]) ).
fof(f4029,plain,
! [X0] :
( v1001(X0)
| ~ v1000(X0,bitIndex0) ),
inference(cnf_transformation,[],[f2242]) ).
fof(f4031,plain,
! [X0] : v1000(X0,bitIndex1),
inference(cnf_transformation,[],[f1158]) ).
fof(f4033,plain,
! [X0] :
( v1003(X0)
| ~ v1001(X0) ),
inference(cnf_transformation,[],[f2244]) ).
fof(f4035,plain,
! [X0] :
( v1007(X0,bitIndex4)
| ~ v1003(X0) ),
inference(cnf_transformation,[],[f2246]) ).
fof(f4052,plain,
! [X0] : ~ v1007(X0,bitIndex4),
inference(cnf_transformation,[],[f52]) ).
fof(f7832,plain,
! [X0] : v4(X0),
inference(global_subsumption,[],[f4021,f4022,f4023,f4024,f4026,f4028,f4029,f4031,f4033,f4035,f4052]) ).
fof(f8541,plain,
$false,
inference(resolution,[],[f7832,f4020]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV095+1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 11:32:37 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.17/0.53 % (3381899)Will run a generic schedule for satisfiability detection.
% 0.17/0.53 % (3381906)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4020387428:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.53 % (3381905)% WARNING: option uhcvi not known.
% 0.17/0.53 % (3381904)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=759175583_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.53 % (3381905)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=334763646:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.53 % (3381907)dis+10_1_sil=32000:sp=arity:random_seed=1206672658:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.53 % (3381908)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1818722802:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.53 % (3381909)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1375416023:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.53 % (3381910)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=347104172:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.53 % (3381906) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3381899-3381906"...
% 0.17/0.53 % (3381907)Instruction limit reached!
% 0.17/0.53 % (3381907)------------------------------
% 0.17/0.53 % (3381907)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.53 % (3381907)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.53 % (3381907)CaDiCaL version: 2.1.3
% 0.17/0.53 % (3381907)Termination reason: Instruction limit
% 0.17/0.53 % (3381907)Termination phase: Saturation
% 0.17/0.53 % (3381907)Time elapsed: 0.050 s
% 0.17/0.53 % (3381907)Peak memory usage: 16 MB
% 0.17/0.53 % (3381907)Instructions burned: 104 (million)
% 0.17/0.53 % (3381906)...printing done.
% 0.17/0.53 % (3381906)Refutation found. Thanks to Tanya!
% 0.17/0.53 % SZS status Theorem for theBenchmark
% 0.17/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.54 % (3381906)------------------------------
% 0.17/0.54 % (3381906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.54 % (3381906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.54 % (3381906)CaDiCaL version: 2.1.3
% 0.17/0.54 % (3381906)Termination reason: Refutation
% 0.17/0.54 % (3381906)Time elapsed: 0.057 s
% 0.17/0.54 % (3381906)Peak memory usage: 20 MB
% 0.17/0.54 % (3381906)Instructions burned: 201 (million)
% 0.17/0.54 % (3381899)Success in time 0.114 s
% 0.17/0.54 % Vampire exiting
%------------------------------------------------------------------------------