%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:38:05 PM UTC 2026
% Result : Theorem 2.58s 1.07s
% Output : Refutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 20 unt; 2 def)
% Number of atoms : 102 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 87 ( 43 ~; 34 |; 1 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(f47,axiom,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f51,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_dec(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(f58,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f66,axiom,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(f68,axiom,
! [X0] :
( pred_attacker(tuple_A_out_3(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(f70,axiom,
! [X0] :
( pred_attacker(tuple_A_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_2(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(f78,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax77) ).
fof(f79,axiom,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f80,axiom,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(f82,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f83,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f82]) ).
fof(f84,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f83]) ).
fof(f88,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f51]) ).
fof(f89,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f88]) ).
fof(f101,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(ennf_transformation,[],[f66]) ).
fof(f103,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_3(X0)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f105,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_1(X0)) ),
inference(ennf_transformation,[],[f70]) ).
fof(f106,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f71]) ).
fof(f112,plain,
! [X0] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(ennf_transformation,[],[f79]) ).
fof(f113,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(ennf_transformation,[],[f80]) ).
fof(f160,plain,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f46]) ).
fof(f161,plain,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f47]) ).
fof(f165,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f172,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f58]) ).
fof(f180,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f182,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_3(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f184,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f185,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f191,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnf_transformation,[],[f78]) ).
fof(f192,plain,
! [X0] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f112]) ).
fof(f193,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f113]) ).
fof(f195,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f84]) ).
fof(f197,definition,
( spl0_1
<=> ! [X0] : ~ pred_attacker(tuple_A_in_2(X0)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f198,plain,
( ! [X0] : ~ pred_attacker(tuple_A_in_2(X0))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f200,definition,
( spl0_2
<=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f202,plain,
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f203,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f193,f200,f197]) ).
fof(f211,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(resolution,[],[f191,f184]) ).
fof(f212,plain,
( pred_attacker(constr_enc(name_objective,name_m_9))
| ~ spl0_2 ),
inference(resolution,[],[f202,f180]) ).
fof(f215,plain,
! [X0] :
( pred_attacker(constr_comm_dec(X0,name_Ka))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(resolution,[],[f192,f182]) ).
fof(f217,plain,
! [X0,X1] :
( ~ pred_attacker(constr_enc(X0,X1))
| pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(superposition,[],[f165,f160]) ).
fof(f220,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X0,name_Ka)))
| pred_attacker(X0) ),
inference(superposition,[],[f215,f161]) ).
fof(f221,plain,
! [X0] :
( ~ pred_attacker(constr_comm_enc(X0,name_Ka))
| pred_attacker(X0) ),
inference(resolution,[],[f220,f185]) ).
fof(f223,plain,
pred_attacker(name_m_9),
inference(resolution,[],[f221,f211]) ).
fof(f225,plain,
( pred_attacker(name_objective)
| ~ pred_attacker(name_m_9)
| ~ spl0_2 ),
inference(resolution,[],[f217,f212]) ).
fof(f227,plain,
( ~ pred_attacker(name_m_9)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f225,f195]) ).
fof(f234,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f223,f227]) ).
fof(f235,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f234]) ).
fof(f246,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_1 ),
inference(resolution,[],[f198,f185]) ).
fof(f247,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f246,f172]) ).
fof(f284,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f247]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f203]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f235]) ).
cnf(s15,plain,
~ spl0_1,
inference(sat_conversion,[],[f284]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s1,s2,s15]) ).
fof(f285,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.19 % Computer : n013.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Mon Sep 28 14:47:36 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.23 Running first-order theorem proving
% 0.11/0.23 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/1.07 % (1237149)Detected formulas, will run a generic FOF schedule.
% 2.58/1.07 % (1237303)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2404599506:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.58/1.07 % (1237303)First to succeed.
% 2.58/1.07 % (1237303)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1237149"
% 2.58/1.07 % (1237293)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3369272346:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.58/1.07 % (1237292)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=229970673:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.58/1.07 % (1237301)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2745494683:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.58/1.07 % (1237301)Refutation not found, incomplete strategy
% 2.58/1.07 % (1237301)------------------------------
% 2.58/1.07 % (1237301)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.07 % (1237301)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.07 % (1237301)CaDiCaL version: 2.1.3
% 2.58/1.07 % (1237301)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.07 % (1237301)Time elapsed: 0.001 s
% 2.58/1.07 % (1237301)Peak memory usage: 87 MB
% 2.58/1.07 % (1237298)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2134725967:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.58/1.07 % (1237304)dis-21_1_sil=8000:lcm=predicate:random_seed=1004781066:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.58/1.07 % (1237304)Refutation not found, incomplete strategy
% 2.58/1.07 % (1237304)------------------------------
% 2.58/1.07 % (1237304)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.07 % (1237304)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.07 % (1237304)CaDiCaL version: 2.1.3
% 2.58/1.07 % (1237304)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.07 % (1237304)Time elapsed: 0.003 s
% 2.58/1.07 % (1237304)Peak memory usage: 88 MB
% 2.58/1.07 % (1237304)Instructions burned: 4 (million)
% 2.58/1.07 % (1237302)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2178239745:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.58/1.07 % (1237302)Refutation not found, incomplete strategy
% 2.58/1.07 % (1237302)------------------------------
% 2.58/1.07 % (1237302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.07 % (1237302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.07 % (1237302)CaDiCaL version: 2.1.3
% 2.58/1.07 % (1237302)Termination reason: Refutation not found, incomplete strategy
% 2.58/1.07 % (1237302)Time elapsed: 0.001 s
% 2.58/1.07 % (1237302)Peak memory usage: 87 MB
% 2.58/1.07 % (1237303)Refutation found. Thanks to Tanya!
% 2.58/1.07 % SZS status Theorem for theBenchmark
% 2.58/1.07 % SZS output start Proof for theBenchmark
% See solution above
% 2.58/1.07 % (1237303)------------------------------
% 2.58/1.07 % (1237303)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.58/1.07 % (1237303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.58/1.07 % (1237303)CaDiCaL version: 2.1.3
% 2.58/1.07 % (1237303)Termination reason: Refutation
% 2.58/1.07 % (1237303)Time elapsed: 0.003 s
% 2.58/1.07 % (1237303)Peak memory usage: 89 MB
% 2.58/1.07 % (1237303)Instructions burned: 6 (million)
% 2.58/1.07 % (1237303)------------------------------
% 2.58/1.07 % (1237303)------------------------------
% 2.58/1.07 % (1237149)Success in time 0.293 s
% 2.58/1.07 % Vampire exiting
%------------------------------------------------------------------------------