%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:45:15 PM UTC 2026
% Result : Theorem 0.12s 0.26s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 21 unt; 2 def)
% Number of atoms : 101 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 85 ( 42 ~; 33 |; 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 : 41 ( 0 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax45) ).
fof(f47,axiom,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f51,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_dec(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax50) ).
fof(f58,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f66,axiom,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f68,axiom,
! [X0] :
( pred_attacker(tuple_A_out_3(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(f70,axiom,
! [X0] :
( pred_attacker(tuple_A_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(f78,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',ax79) ).
fof(f82,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/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,X1] :
( ~ pred_attacker(constr_enc(X0,X1))
| pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(superposition,[],[f165,f160]) ).
fof(f218,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_2(constr_comm_enc(X0,name_Ka)))
| pred_attacker(tuple_A_out_3(X0)) ),
inference(superposition,[],[f192,f161]) ).
fof(f221,plain,
( pred_attacker(name_objective)
| ~ pred_attacker(name_m_9)
| ~ spl0_2 ),
inference(resolution,[],[f215,f212]) ).
fof(f224,plain,
( ~ pred_attacker(name_m_9)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f221,f195]) ).
fof(f230,plain,
! [X0] :
( ~ pred_attacker(constr_comm_enc(X0,name_Ka))
| pred_attacker(tuple_A_out_3(X0)) ),
inference(resolution,[],[f218,f185]) ).
fof(f232,plain,
pred_attacker(tuple_A_out_3(name_m_9)),
inference(resolution,[],[f230,f211]) ).
fof(f234,plain,
pred_attacker(name_m_9),
inference(resolution,[],[f232,f182]) ).
fof(f235,plain,
( $false
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f234,f224]) ).
fof(f236,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f235]) ).
fof(f247,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_1 ),
inference(resolution,[],[f198,f185]) ).
fof(f248,plain,
( $false
| ~ spl0_1 ),
inference(resolution,[],[f247,f172]) ).
fof(f286,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f248]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f203]) ).
cnf(s2,plain,
~ spl0_2,
inference(sat_conversion,[],[f236]) ).
cnf(s16,plain,
~ spl0_1,
inference(sat_conversion,[],[f286]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s1,s2,s16]) ).
fof(f287,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW955+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.18 % Computer : n013.cluster.edu
% 0.12/0.18 % Model : x86_64 x86_64
% 0.12/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18 % Memory : 8046.5625MB
% 0.12/0.18 % OS : Linux 6.8.0-71-generic
% 0.12/0.18 % CPULimit : 300
% 0.12/0.18 % WCLimit : 300
% 0.12/0.18 % DateTime : Mon Sep 28 14:47:37 UTC 2026
% 0.12/0.18 % CPUTime :
% 0.12/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.21 Running first-order model finding
% 0.12/0.21 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.12/0.26 % (1237278)Will run a generic schedule for satisfiability detection.
% 0.12/0.26 % (1237289)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1943657984:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.26 % (1237284)% WARNING: option uhcvi not known.
% 0.12/0.26 % (1237285)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=235817524:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.26 % (1237286)dis+10_1_sil=32000:sp=arity:random_seed=427557187:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.26 % (1237283)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3993210051_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.26 % (1237287)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1245362137:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.26 % (1237284)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3972032493:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.26 % (1237288)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1559189437:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.26 % Detected minimum model sizes of [10]
% 0.12/0.26 % Detected maximum model sizes of [max]
% 0.12/0.26 % TRYING [10]
% 0.12/0.26 % (1237286) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1237278-1237286"...
% 0.12/0.26 % (1237289) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1237278-1237289"...
% 0.12/0.26 % (1237286)...printing done.
% 0.12/0.26 % (1237289)...printing done.
% 0.12/0.26 % (1237286)Refutation found. Thanks to Tanya!
% 0.12/0.26 % SZS status Theorem for theBenchmark
% 0.12/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.26 % (1237286)------------------------------
% 0.12/0.26 % (1237286)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.26 % (1237286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.26 % (1237286)CaDiCaL version: 2.1.3
% 0.12/0.26 % (1237286)Termination reason: Refutation
% 0.12/0.26 % (1237286)Time elapsed: 0.005 s
% 0.12/0.26 % (1237286)Peak memory usage: 12 MB
% 0.12/0.26 % (1237286)Instructions burned: 5 (million)
% 0.12/0.26 % (1237278)Success in time 0.047 s
% 0.12/0.26 % Vampire exiting
%------------------------------------------------------------------------------