%------------------------------------------------------------------------------
% File : Vampire---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 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 01:38:05 PM UTC 2026
% Result : Theorem 3.67s 1.29s
% Output : Refutation 3.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 68 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 29 ~; 23 |; 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 : 36 ( 36 !; 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(f246,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(f247,plain,
! [X0,X1] :
( ~ pred_attacker(constr_enc(X0,X1))
| pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(superposition,[],[f193,f186]) ).
fof(f250,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,[],[f246,f247]) ).
fof(f251,plain,
! [X0] :
( ~ pred_attacker(tuple_A_in_3(X0))
| ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7)) ),
inference(forward_subsumption_resolution,[],[f250,f223]) ).
fof(f252,plain,
! [X0] :
( ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7))
| ~ pred_attacker(X0) ),
inference(resolution,[],[f251,f213]) ).
fof(f263,plain,
~ pred_attacker(name_G_8),
inference(resolution,[],[f252,f240]) ).
fof(f268,plain,
$false,
inference(forward_subsumption_resolution,[],[f263,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 THM
% 0.06/0.18 % Computer : n009.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Mon Sep 28 14:48:15 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running first-order theorem proving
% 0.06/0.21 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.67/1.29 % (3080826)Detected formulas, will run a generic FOF schedule.
% 3.67/1.29 % (3080831)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=473462260:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.67/1.29 % (3080836)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2708831270:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.67/1.29 % (3080834)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2129600299:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.67/1.29 % (3080835)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=565192178:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.67/1.29 % (3080833)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=2388859696:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.67/1.29 % (3080832)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=553846759:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.67/1.29 % (3080837)dis-21_1_sil=8000:lcm=predicate:random_seed=1949013657: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)
% 3.67/1.29 % (3080834)Refutation not found, incomplete strategy
% 3.67/1.29 % (3080834)------------------------------
% 3.67/1.29 % (3080834)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (3080834)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (3080834)CaDiCaL version: 2.1.3
% 3.67/1.29 % (3080834)Termination reason: Refutation not found, incomplete strategy
% 3.67/1.29 % (3080834)Time elapsed: 0.001 s
% 3.67/1.29 % (3080835)Refutation not found, incomplete strategy
% 3.67/1.29 % (3080835)------------------------------
% 3.67/1.29 % (3080835)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (3080834)Peak memory usage: 87 MB
% 3.67/1.29 % (3080835)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (3080835)CaDiCaL version: 2.1.3
% 3.67/1.29 % (3080835)Termination reason: Refutation not found, incomplete strategy
% 3.67/1.29 % (3080835)Time elapsed: 0.001 s
% 3.67/1.29 % (3080835)Peak memory usage: 87 MB
% 3.67/1.29 % (3080837)Refutation not found, incomplete strategy
% 3.67/1.29 % (3080837)------------------------------
% 3.67/1.29 % (3080837)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (3080837)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (3080837)CaDiCaL version: 2.1.3
% 3.67/1.29 % (3080837)Termination reason: Refutation not found, incomplete strategy
% 3.67/1.29 % (3080837)Time elapsed: 0.003 s
% 3.67/1.29 % (3080837)Peak memory usage: 88 MB
% 3.67/1.29 % (3080837)Instructions burned: 4 (million)
% 3.67/1.29 % (3080836)First to succeed.
% 3.67/1.29 % (3080836)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3080826"
% 3.67/1.29 % (3080837)------------------------------
% 3.67/1.29 % (3080837)------------------------------
% 3.67/1.29 % (3080835)------------------------------
% 3.67/1.29 % (3080835)------------------------------
% 3.67/1.29 % (3080834)------------------------------
% 3.67/1.29 % (3080834)------------------------------
% 3.67/1.29 % (3080836)Refutation found. Thanks to Tanya!
% 3.67/1.29 % SZS status Theorem for theBenchmark
% 3.67/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.67/1.29 % (3080836)------------------------------
% 3.67/1.29 % (3080836)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.67/1.29 % (3080836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.67/1.29 % (3080836)CaDiCaL version: 2.1.3
% 3.67/1.29 % (3080836)Termination reason: Refutation
% 3.67/1.29 % (3080836)Time elapsed: 0.005 s
% 3.67/1.29 % (3080836)Peak memory usage: 89 MB
% 3.67/1.29 % (3080836)Instructions burned: 6 (million)
% 3.67/1.29 % (3080836)------------------------------
% 3.67/1.29 % (3080836)------------------------------
% 3.67/1.29 % (3080826)Success in time 0.437 s
% 3.67/1.29 % Vampire exiting
%------------------------------------------------------------------------------