%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW956+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 : n018.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.11s 0.24s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 67 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 28 ~; 22 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f63,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_dec(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax62) ).
fof(f77,axiom,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f79,axiom,
! [X0] :
( pred_attacker(tuple_A_out_2(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f82,axiom,
! [X0,X1] :
( pred_attacker(tuple_A_out_1(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_3(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f90,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax89) ).
fof(f91,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(f92,axiom,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax91) ).
fof(f94,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f95,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[status(cth)],[f94]) ).
fof(f96,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f95]) ).
fof(f104,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f63]) ).
fof(f105,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f104]) ).
fof(f115,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f117,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_2(X0)) ),
inference(ennf_transformation,[],[f79]) ).
fof(f121,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X0,X1)) ),
inference(ennf_transformation,[],[f82]) ).
fof(f122,plain,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f128,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(ennf_transformation,[],[f92]) ).
fof(f186,plain,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f56]) ).
fof(f193,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f207,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f209,plain,
! [X0] :
( ~ pred_attacker(tuple_A_out_2(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f212,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_A_out_1(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f213,plain,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f219,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(cnf_transformation,[],[f90]) ).
fof(f220,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(cnf_transformation,[],[f91]) ).
fof(f221,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(cnf_transformation,[],[f128]) ).
fof(f223,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f96]) ).
fof(f237,plain,
pred_attacker(name_G_8),
inference(resolution,[],[f212,f219]) ).
fof(f240,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(resolution,[],[f220,f209]) ).
fof(f241,plain,
! [X0,X1] :
( ~ pred_attacker(constr_enc(X0,X1))
| pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(superposition,[],[f193,f186]) ).
fof(f249,plain,
! [X0] :
( pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(resolution,[],[f221,f207]) ).
fof(f258,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_3(X0))
| pred_attacker(name_objective)
| ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7)) ),
inference(resolution,[],[f249,f241]) ).
fof(f261,plain,
! [X0] :
( ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(forward_subsumption_resolution,[],[f258,f223]) ).
fof(f265,plain,
~ pred_attacker(tuple_A_in_3(name_G_8)),
inference(resolution,[],[f261,f240]) ).
fof(f270,plain,
~ pred_attacker(name_G_8),
inference(resolution,[],[f265,f213]) ).
fof(f271,plain,
$false,
inference(forward_subsumption_resolution,[],[f270,f237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW956+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.11/0.16 % Computer : n018.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Mon Sep 28 14:50:25 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.19 Running first-order model finding
% 0.11/0.19 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.11/0.24 % (3445467)Will run a generic schedule for satisfiability detection.
% 0.11/0.24 % (3445475)dis+10_1_sil=32000:sp=arity:random_seed=558916644:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.24 % (3445475) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3445467-3445475"...
% 0.11/0.24 % (3445475)...printing done.
% 0.11/0.24 % (3445475)Refutation found. Thanks to Tanya!
% 0.11/0.24 % SZS status Theorem for theBenchmark
% 0.11/0.24 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.24 % (3445475)------------------------------
% 0.11/0.24 % (3445475)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.24 % (3445475)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.24 % (3445475)CaDiCaL version: 2.1.3
% 0.11/0.24 % (3445475)Termination reason: Refutation
% 0.11/0.24 % (3445475)Time elapsed: 0.003 s
% 0.11/0.24 % (3445475)Peak memory usage: 12 MB
% 0.11/0.24 % (3445475)Instructions burned: 6 (million)
% 0.11/0.24 % (3445467)Success in time 0.037 s
% 0.11/0.24 % Vampire exiting
%------------------------------------------------------------------------------