%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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:14 PM UTC 2026
% Result : Theorem 0.25s 0.36s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 14 unt; 4 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 81 ( 42 ~; 30 |; 1 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 25 ( 0 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f47,axiom,
! [X0] :
( pred_attacker(tuple_T_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f50,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_T_in_3(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f52,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_T_in_1(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f58,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).
fof(f65,axiom,
! [X0,X1] :
( ( pred_attacker(tuple_T_in_3(X0))
& pred_attacker(tuple_T_in_1(X1)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax64) ).
fof(f66,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f67,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f66]) ).
fof(f68,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f67]) ).
fof(f74,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_4(X0)) ),
inference(ennf_transformation,[],[f47]) ).
fof(f77,plain,
! [X0] :
( pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f79,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f52]) ).
fof(f86,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(ennf_transformation,[],[f65]) ).
fof(f87,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(flattening,[],[f86]) ).
fof(f134,plain,
! [X0] :
( ~ pred_attacker(tuple_T_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f137,plain,
! [X0] :
( pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f77]) ).
fof(f139,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f145,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f58]) ).
fof(f151,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(tuple_T_in_1(X1)) ),
inference(cnf_transformation,[],[f87]) ).
fof(f152,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f68]) ).
fof(f157,definition,
( spl0_2
<=> ! [X0] : ~ pred_attacker(X0) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f158,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f157]) ).
fof(f159,plain,
( $false
| ~ spl0_2 ),
inference(resolution,[],[f158,f145]) ).
fof(f179,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f215,definition,
( spl0_9
<=> ! [X0] : ~ pred_attacker(tuple_T_in_3(X0)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f216,plain,
( ! [X0] : ~ pred_attacker(tuple_T_in_3(X0))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f215]) ).
fof(f218,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_9 ),
inference(resolution,[],[f216,f137]) ).
fof(f219,plain,
( spl0_2
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f218,f215,f157]) ).
fof(f226,definition,
( spl0_11
<=> ! [X0] : ~ pred_attacker(tuple_T_in_1(X0)) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f227,plain,
( ! [X0] : ~ pred_attacker(tuple_T_in_1(X0))
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f229,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_11 ),
inference(resolution,[],[f227,f139]) ).
fof(f230,plain,
( spl0_2
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f229,f226,f157]) ).
fof(f287,definition,
( spl0_16
<=> pred_attacker(tuple_T_out_4(name_objective)) ),
introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).
fof(f289,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| ~ spl0_16 ),
inference(avatar_component_clause,[],[f287]) ).
fof(f290,plain,
( spl0_11
| spl0_9
| spl0_16 ),
inference(avatar_split_clause,[],[f151,f287,f215,f226]) ).
fof(f291,plain,
( pred_attacker(name_objective)
| ~ spl0_16 ),
inference(resolution,[],[f289,f134]) ).
fof(f292,plain,
( $false
| ~ spl0_16 ),
inference(forward_subsumption_resolution,[],[f291,f152]) ).
fof(f293,plain,
~ spl0_16,
inference(avatar_contradiction_clause,[],[f292]) ).
cnf(s128,plain,
~ spl0_2,
inference(sat_conversion,[],[f179]) ).
cnf(s171,plain,
( spl0_2
| ~ spl0_9 ),
inference(sat_conversion,[],[f219]) ).
cnf(s184,plain,
( spl0_2
| ~ spl0_11 ),
inference(sat_conversion,[],[f230]) ).
cnf(s227,plain,
( spl0_9
| spl0_11
| spl0_16 ),
inference(sat_conversion,[],[f290]) ).
cnf(s230,plain,
~ spl0_16,
inference(sat_conversion,[],[f293]) ).
cnf(s231,plain,
( spl0_9
| spl0_11 ),
inference(rat,[],[s227,s230]) ).
cnf(s238,plain,
~ spl0_11,
inference(rat,[],[s184,s128]) ).
cnf(s239,plain,
~ spl0_9,
inference(rat,[],[s171,s128]) ).
cnf(s242,plain,
$false,
inference(rat,[],[s231,s238,s239]) ).
fof(f294,plain,
$false,
inference(avatar_sat_refutation,[],[s242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.26 % Computer : n013.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Mon Sep 28 14:46:51 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.25/0.31 Running first-order model finding
% 0.25/0.31 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.25/0.36 % (1235155)Will run a generic schedule for satisfiability detection.
% 0.25/0.36 % (1235162)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=669538899:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.25/0.36 % (1235164)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=200356019:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.25/0.36 % (1235162) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1235155-1235162"...
% 0.25/0.36 % (1235162)...printing done.
% 0.25/0.36 % (1235164) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1235155-1235164"...
% 0.25/0.36 % (1235162)Refutation found. Thanks to Tanya!
% 0.25/0.36 % SZS status Theorem for theBenchmark
% 0.25/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.36 % (1235162)------------------------------
% 0.25/0.36 % (1235162)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.25/0.36 % (1235162)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.25/0.36 % (1235162)CaDiCaL version: 2.1.3
% 0.25/0.36 % (1235162)Termination reason: Refutation
% 0.25/0.36 % (1235162)Time elapsed: 0.005 s
% 0.25/0.36 % (1235162)Peak memory usage: 12 MB
% 0.25/0.36 % (1235162)Instructions burned: 6 (million)
% 0.25/0.36 % (1235155)Success in time 0.029 s
% 0.25/0.36 % Vampire exiting
%------------------------------------------------------------------------------