%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 10:35:08 AM UTC 2026
% Result : Unsatisfiable 3.61s 1.44s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 54 ( 16 unt; 4 def)
% Number of atoms : 103 ( 52 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 80 ( 31 ~; 45 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( X0 = o
| X0 = i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_domain) ).
fof(f2,plain,
! [X0] :
( i = X0
| o = X0 ),
inference(reorient_equations,[],[f1]) ).
fof(f3,axiom,
! [X0] : inv(X0) != X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_inverse) ).
fof(f4,axiom,
! [X0] : unpack1(X0,pack1(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1) ).
fof(f5,axiom,
! [X0] : unpack1(inv(X0),pack1(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_01) ).
fof(f6,axiom,
! [X0] : unpack1(X0,inv(pack1(X0))) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_02) ).
fof(f8,plain,
! [X0] :
( i != X0
| o = inv(X0) ),
inference(superposition,[],[f3,f2]) ).
fof(f14,definition,
( spl0_2
<=> o = i ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f16,plain,
( o != i
| spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f19,plain,
! [X0] :
( o = pack1(X0)
| unpack1(X0,i) = X0 ),
inference(superposition,[],[f4,f2]) ).
fof(f22,plain,
! [X0] :
( o = inv(X0)
| unpack1(i,pack1(X0)) = X0 ),
inference(superposition,[],[f5,f2]) ).
fof(f23,plain,
! [X0] :
( unpack1(inv(X0),i) = X0
| o = pack1(X0) ),
inference(superposition,[],[f5,f2]) ).
fof(f26,plain,
! [X0] :
( unpack1(X0,inv(i)) = X0
| o = pack1(X0) ),
inference(superposition,[],[f6,f2]) ).
fof(f31,plain,
o = inv(i),
inference(equality_resolution,[],[f8]) ).
fof(f57,plain,
i = unpack1(o,pack1(i)),
inference(superposition,[],[f5,f31]) ).
fof(f58,plain,
o != i,
inference(superposition,[],[f3,f31]) ).
fof(f60,plain,
! [X0] :
( unpack1(X0,inv(o)) = X0
| unpack1(X0,i) = X0 ),
inference(superposition,[],[f6,f19]) ).
fof(f72,definition,
( spl0_3
<=> o = pack1(i) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f74,plain,
( o = pack1(i)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f72]) ).
fof(f76,definition,
( spl0_4
<=> i = unpack1(o,i) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f78,plain,
( i = unpack1(o,i)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f76]) ).
fof(f84,definition,
( spl0_6
<=> i = unpack1(o,o) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f86,plain,
( i = unpack1(o,o)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f96,plain,
! [X0] :
( o != X0
| unpack1(i,pack1(X0)) = X0 ),
inference(superposition,[],[f3,f22]) ).
fof(f101,plain,
( i = unpack1(o,o)
| ~ spl0_3 ),
inference(superposition,[],[f57,f74]) ).
fof(f104,plain,
( i = unpack1(i,o)
| ~ spl0_3 ),
inference(superposition,[],[f4,f74]) ).
fof(f106,plain,
( spl0_6
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f101,f72,f84]) ).
fof(f107,plain,
( i = unpack1(o,i)
| o = pack1(i) ),
inference(superposition,[],[f23,f31]) ).
fof(f119,plain,
! [X0] :
( unpack1(X0,o) = X0
| o = pack1(X0) ),
inference(forward_demodulation,[],[f26,f31]) ).
fof(f130,plain,
( o = i
| o = pack1(o)
| ~ spl0_6 ),
inference(superposition,[],[f86,f119]) ).
fof(f131,plain,
( o = pack1(o)
| spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f130,f16]) ).
fof(f147,plain,
o = unpack1(i,pack1(o)),
inference(equality_resolution,[],[f96]) ).
fof(f148,plain,
( o = unpack1(i,o)
| spl0_2
| ~ spl0_6 ),
inference(forward_demodulation,[],[f147,f131]) ).
fof(f152,plain,
( o = i
| spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(superposition,[],[f148,f104]) ).
fof(f159,plain,
( $false
| spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f152,f16]) ).
fof(f160,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f161,plain,
~ spl0_2,
inference(avatar_split_clause,[],[f58,f14]) ).
fof(f171,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f107,f76,f72]) ).
fof(f287,plain,
! [X0] :
( unpack1(X0,i) = X0
| unpack1(X0,i) = X0
| o = inv(o) ),
inference(superposition,[],[f60,f2]) ).
fof(f290,plain,
! [X0] :
( unpack1(X0,i) = X0
| o = inv(o) ),
inference(duplicate_literal_removal,[],[f287]) ).
fof(f291,plain,
! [X0] : unpack1(X0,i) = X0,
inference(forward_subsumption_resolution,[],[f290,f3]) ).
fof(f314,plain,
( o = i
| ~ spl0_4 ),
inference(superposition,[],[f291,f78]) ).
fof(f326,plain,
( $false
| spl0_2
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f314,f16]) ).
fof(f327,plain,
( spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f326]) ).
cnf(s5,plain,
( ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f106]) ).
cnf(s8,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_6 ),
inference(sat_conversion,[],[f160]) ).
cnf(s9,plain,
~ spl0_2,
inference(sat_conversion,[],[f161]) ).
cnf(s12,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f171]) ).
cnf(s19,plain,
( spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f327]) ).
cnf(s20,plain,
~ spl0_4,
inference(rat,[],[s19,s9]) ).
cnf(s21,plain,
spl0_3,
inference(rat,[],[s12,s20]) ).
cnf(s22,plain,
~ spl0_6,
inference(rat,[],[s8,s21,s9]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s5,s22,s21]) ).
fof(f328,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 11:15:30 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.61/1.44 % (1875966)Input is clausal, will run a generic CNF schedule.
% 3.61/1.44 % (1875974)lrs+10_1_sil=8000:sp=occurrence:random_seed=2267498937:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.61/1.44 % (1875974)Refutation not found, incomplete strategy
% 3.61/1.44 % (1875974)------------------------------
% 3.61/1.44 % (1875974)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.44 % (1875974)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.44 % (1875974)CaDiCaL version: 2.1.3
% 3.61/1.44 % (1875974)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.44 % (1875974)Time elapsed: 0.0000 s
% 3.61/1.44 % (1875974)Peak memory usage: 86 MB
% 3.61/1.44 % (1875971)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1480338002:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.61/1.44 % (1875973)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=35482676:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.61/1.44 % (1875972)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3826836267:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.61/1.44 % (1875975)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1232293328:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.61/1.44 % (1875977)dis-21_1_sil=8000:lcm=predicate:random_seed=3349112669:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.61/1.44 % (1875976)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3949270059:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.61/1.44 % (1875975)Refutation not found, incomplete strategy
% 3.61/1.44 % (1875975)------------------------------
% 3.61/1.44 % (1875975)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.44 % (1875975)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.44 % (1875975)CaDiCaL version: 2.1.3
% 3.61/1.44 % (1875975)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.44 % (1875975)Time elapsed: 0.001 s
% 3.61/1.44 % (1875975)Peak memory usage: 86 MB
% 3.61/1.44 % (1875977)Refutation not found, incomplete strategy
% 3.61/1.44 % (1875977)------------------------------
% 3.61/1.44 % (1875977)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.44 % (1875977)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.44 % (1875977)CaDiCaL version: 2.1.3
% 3.61/1.44 % (1875977)Termination reason: Refutation not found, incomplete strategy
% 3.61/1.44 % (1875977)Time elapsed: 0.001 s
% 3.61/1.44 % (1875977)Peak memory usage: 88 MB
% 3.61/1.44 % (1875976)First to succeed.
% 3.61/1.44 % (1875976)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1875966"
% 3.61/1.44 % (1875974)------------------------------
% 3.61/1.44 % (1875974)------------------------------
% 3.61/1.44 % (1875977)------------------------------
% 3.61/1.44 % (1875977)------------------------------
% 3.61/1.44 % (1875975)------------------------------
% 3.61/1.44 % (1875975)------------------------------
% 3.61/1.44 % (1875976)Refutation found. Thanks to Tanya!
% 3.61/1.44 % SZS status Unsatisfiable for theBenchmark
% 3.61/1.44 % SZS output start Proof for theBenchmark
% See solution above
% 3.61/1.44 % (1875976)------------------------------
% 3.61/1.44 % (1875976)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.61/1.44 % (1875976)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.61/1.44 % (1875976)CaDiCaL version: 2.1.3
% 3.61/1.44 % (1875976)Termination reason: Refutation
% 3.61/1.44 % (1875976)Time elapsed: 0.010 s
% 3.61/1.44 % (1875976)Peak memory usage: 89 MB
% 3.61/1.44 % (1875976)Instructions burned: 12 (million)
% 3.61/1.44 % (1875976)------------------------------
% 3.61/1.44 % (1875976)------------------------------
% 3.61/1.44 % (1875966)Success in time 0.429 s
% 3.61/1.44 % Vampire exiting
%------------------------------------------------------------------------------