%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW958+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 : n012.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.08s 0.17s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 30
% Syntax : Number of formulae : 143 ( 36 unt; 8 def)
% Number of atoms : 327 ( 15 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 362 ( 178 ~; 155 |; 7 &)
% ( 8 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 153 ( 0 sgn 153 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f191,axiom,
! [X0,X1] : constr_adec(constr_aenc(X1,constr_pkey(X0)),X0) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax190) ).
fof(f192,axiom,
! [X0] : constr_add(X0,constr_neg(X0)) = constr_ZERO,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax191) ).
fof(f193,axiom,
! [X0] : constr_add(X0,constr_ZERO) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax192) ).
fof(f194,axiom,
! [X0,X1] : constr_add(X0,X1) = constr_add(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax193) ).
fof(f195,axiom,
! [X0,X1,X2] : constr_add(X0,constr_add(X1,X2)) = constr_add(constr_add(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax194) ).
fof(f197,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(constr_pkey(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax196) ).
fof(f205,axiom,
! [X0] :
( pred_attacker(tuple_out_1(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax204) ).
fof(f206,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(constr_neg(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax205) ).
fof(f239,axiom,
! [X0] :
( pred_attacker(tuple_client_A_out_5(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax238) ).
fof(f242,axiom,
! [X0,X1] :
( pred_attacker(tuple_client_A_out_3(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax241) ).
fof(f243,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(tuple_client_A_in_4(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax242) ).
fof(f246,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_2(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax245) ).
fof(f247,axiom,
! [X0] :
( pred_attacker(tuple_client_A_in_2(X0))
=> pred_attacker(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax246) ).
fof(f248,axiom,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_client_A_in_1(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax247) ).
fof(f250,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_aenc(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax249) ).
fof(f251,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_adec(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax250) ).
fof(f252,axiom,
! [X0,X1] :
( ( pred_attacker(X0)
& pred_attacker(X1) )
=> pred_attacker(constr_add(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax251) ).
fof(f258,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax257) ).
fof(f268,axiom,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax267) ).
fof(f272,axiom,
! [X0,X1] :
( ( pred_attacker(tuple_client_A_in_2(X0))
& pred_attacker(tuple_client_A_in_1(X1)) )
=> pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax271) ).
fof(f273,axiom,
! [X0,X1,X2] :
( ( pred_attacker(tuple_client_A_in_4(X1,X0))
& pred_attacker(tuple_client_A_in_2(X1))
& pred_attacker(tuple_client_A_in_1(X2)) )
=> pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax272) ).
fof(f277,conjecture,
pred_attacker(name_Sa),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f278,negated_conjecture,
~ pred_attacker(name_Sa),
inference(negated_conjecture,[status(cth)],[f277]) ).
fof(f279,plain,
~ pred_attacker(name_Sa),
inference(flattening,[],[f278]) ).
fof(f281,plain,
! [X0] :
( pred_attacker(constr_pkey(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f197]) ).
fof(f289,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_out_1(X0)) ),
inference(ennf_transformation,[],[f205]) ).
fof(f290,plain,
! [X0] :
( pred_attacker(constr_neg(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f206]) ).
fof(f328,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_A_out_5(X0)) ),
inference(ennf_transformation,[],[f239]) ).
fof(f332,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_A_out_3(X0,X1)) ),
inference(ennf_transformation,[],[f242]) ).
fof(f333,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_in_4(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f243]) ).
fof(f334,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_in_4(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f333]) ).
fof(f337,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f246]) ).
fof(f338,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_client_A_in_2(X0)) ),
inference(ennf_transformation,[],[f247]) ).
fof(f339,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_1(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f248]) ).
fof(f341,plain,
! [X0,X1] :
( pred_attacker(constr_aenc(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f250]) ).
fof(f342,plain,
! [X0,X1] :
( pred_attacker(constr_aenc(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f341]) ).
fof(f343,plain,
! [X0,X1] :
( pred_attacker(constr_adec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f251]) ).
fof(f344,plain,
! [X0,X1] :
( pred_attacker(constr_adec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f343]) ).
fof(f345,plain,
! [X0,X1] :
( pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(ennf_transformation,[],[f252]) ).
fof(f346,plain,
! [X0,X1] :
( pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(flattening,[],[f345]) ).
fof(f351,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ),
inference(ennf_transformation,[],[f272]) ).
fof(f352,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ),
inference(flattening,[],[f351]) ).
fof(f353,plain,
! [X0,X1,X2] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_4(X1,X0))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_1(X2)) ),
inference(ennf_transformation,[],[f273]) ).
fof(f354,plain,
! [X0,X1,X2] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_4(X1,X0))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_1(X2)) ),
inference(flattening,[],[f353]) ).
fof(f551,plain,
! [X0,X1] : constr_adec(constr_aenc(X1,constr_pkey(X0)),X0) = X1,
inference(cnf_transformation,[],[f191]) ).
fof(f552,plain,
! [X0] : constr_ZERO = constr_add(X0,constr_neg(X0)),
inference(cnf_transformation,[],[f192]) ).
fof(f553,plain,
! [X0] : constr_add(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f193]) ).
fof(f554,plain,
! [X0,X1] : constr_add(X0,X1) = constr_add(X1,X0),
inference(cnf_transformation,[],[f194]) ).
fof(f555,plain,
! [X2,X0,X1] : constr_add(X0,constr_add(X1,X2)) = constr_add(constr_add(X0,X1),X2),
inference(cnf_transformation,[],[f195]) ).
fof(f557,plain,
! [X0] :
( pred_attacker(constr_pkey(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f281]) ).
fof(f565,plain,
! [X0] :
( ~ pred_attacker(tuple_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f289]) ).
fof(f566,plain,
! [X0] :
( pred_attacker(constr_neg(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f290]) ).
fof(f599,plain,
! [X0] :
( ~ pred_attacker(tuple_client_A_out_5(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f328]) ).
fof(f602,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_client_A_out_3(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f332]) ).
fof(f603,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_in_4(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f334]) ).
fof(f606,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f337]) ).
fof(f607,plain,
! [X0] :
( ~ pred_attacker(tuple_client_A_in_2(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f338]) ).
fof(f608,plain,
! [X0] :
( pred_attacker(tuple_client_A_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f339]) ).
fof(f610,plain,
! [X0,X1] :
( pred_attacker(constr_aenc(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f342]) ).
fof(f611,plain,
! [X0,X1] :
( pred_attacker(constr_adec(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f344]) ).
fof(f612,plain,
! [X0,X1] :
( pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(cnf_transformation,[],[f346]) ).
fof(f618,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f258]) ).
fof(f627,plain,
pred_attacker(tuple_out_1(constr_pkey(name_skA))),
inference(cnf_transformation,[],[f268]) ).
fof(f631,plain,
! [X0,X1] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ),
inference(cnf_transformation,[],[f352]) ).
fof(f632,plain,
! [X2,X0,X1] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_4(X1,X0))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_1(X2)) ),
inference(cnf_transformation,[],[f354]) ).
fof(f636,plain,
~ pred_attacker(name_Sa),
inference(cnf_transformation,[],[f279]) ).
fof(f638,definition,
( spl0_1
<=> ! [X2] : ~ pred_attacker(tuple_client_A_in_1(X2)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f639,plain,
( ! [X2] : ~ pred_attacker(tuple_client_A_in_1(X2))
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f638]) ).
fof(f641,definition,
( spl0_2
<=> ! [X0,X1] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_4(X1,X0)) ) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f642,plain,
( ! [X0,X1] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_adec(X0,name_skA),constr_neg(name_Na))))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| ~ pred_attacker(tuple_client_A_in_4(X1,X0)) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f641]) ).
fof(f643,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f632,f641,f638]) ).
fof(f645,definition,
( spl0_3
<=> ! [X0] : ~ pred_attacker(tuple_client_A_in_2(X0)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f646,plain,
( ! [X0] : ~ pred_attacker(tuple_client_A_in_2(X0))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f645]) ).
fof(f648,definition,
( spl0_4
<=> ! [X1] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_1(X1)) ) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f649,plain,
( ! [X1] :
( pred_attacker(tuple_client_A_out_3(name_A,constr_aenc(constr_add(name_Na,name_Sa),X1)))
| ~ pred_attacker(tuple_client_A_in_1(X1)) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f648]) ).
fof(f650,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f631,f648,f645]) ).
fof(f657,plain,
pred_attacker(constr_pkey(name_skA)),
inference(resolution,[],[f565,f627]) ).
fof(f666,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f606,f646]) ).
fof(f667,plain,
( $false
| ~ spl0_3 ),
inference(resolution,[],[f666,f618]) ).
fof(f723,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f667]) ).
fof(f726,plain,
! [X0] : constr_add(constr_ZERO,X0) = X0,
inference(superposition,[],[f554,f553]) ).
fof(f756,plain,
! [X0,X1] :
( ~ pred_attacker(constr_aenc(X0,constr_pkey(X1)))
| pred_attacker(X0)
| ~ pred_attacker(X1) ),
inference(superposition,[],[f611,f551]) ).
fof(f763,plain,
! [X0,X1] : constr_add(constr_ZERO,X1) = constr_add(X0,constr_add(constr_neg(X0),X1)),
inference(superposition,[],[f555,f552]) ).
fof(f774,plain,
! [X2,X0,X1] :
( pred_attacker(constr_add(X0,constr_add(X1,X2)))
| ~ pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(X2) ),
inference(superposition,[],[f612,f555]) ).
fof(f778,plain,
! [X0,X1] : constr_add(X0,constr_add(constr_neg(X0),X1)) = X1,
inference(forward_demodulation,[],[f763,f726]) ).
fof(f784,plain,
! [X0] : constr_add(X0,constr_ZERO) = constr_neg(constr_neg(X0)),
inference(superposition,[],[f778,f552]) ).
fof(f789,plain,
! [X0,X1] :
( ~ pred_attacker(constr_add(constr_neg(X1),X0))
| ~ pred_attacker(X1)
| pred_attacker(X0) ),
inference(superposition,[],[f612,f778]) ).
fof(f795,plain,
! [X0] : constr_neg(constr_neg(X0)) = X0,
inference(forward_demodulation,[],[f784,f553]) ).
fof(f797,plain,
( ! [X0] :
( pred_attacker(constr_aenc(constr_add(name_Na,name_Sa),X0))
| ~ pred_attacker(tuple_client_A_in_1(X0)) )
| ~ spl0_4 ),
inference(resolution,[],[f649,f602]) ).
fof(f804,plain,
( ! [X0,X1] :
( ~ pred_attacker(tuple_client_A_in_4(X1,X0))
| ~ pred_attacker(tuple_client_A_in_2(X1))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_neg(name_Na),constr_adec(X0,name_skA)))) )
| ~ spl0_2 ),
inference(forward_demodulation,[],[f642,f554]) ).
fof(f811,definition,
( spl0_5
<=> ! [X1] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_neg(name_Na),constr_adec(X1,name_skA))))
| ~ pred_attacker(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f812,plain,
( ! [X1] :
( pred_attacker(tuple_client_A_out_5(constr_add(constr_neg(name_Na),constr_adec(X1,name_skA))))
| ~ pred_attacker(X1) )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f811]) ).
fof(f1126,plain,
( ! [X0] :
( ~ pred_attacker(tuple_client_A_in_1(constr_pkey(X0)))
| pred_attacker(constr_add(name_Na,name_Sa))
| ~ pred_attacker(X0) )
| ~ spl0_4 ),
inference(resolution,[],[f797,f756]) ).
fof(f1128,definition,
( spl0_12
<=> pred_attacker(constr_add(name_Na,name_Sa)) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f1130,plain,
( pred_attacker(constr_add(name_Na,name_Sa))
| ~ spl0_12 ),
inference(avatar_component_clause,[],[f1128]) ).
fof(f1132,definition,
( spl0_13
<=> ! [X0] :
( ~ pred_attacker(tuple_client_A_in_1(constr_pkey(X0)))
| ~ pred_attacker(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f1133,plain,
( ! [X0] :
( ~ pred_attacker(tuple_client_A_in_1(constr_pkey(X0)))
| ~ pred_attacker(X0) )
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f1132]) ).
fof(f1134,plain,
( spl0_12
| spl0_13
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f1126,f648,f1132,f1128]) ).
fof(f1193,plain,
( ! [X0] :
( pred_attacker(constr_add(constr_neg(name_Na),constr_adec(X0,name_skA)))
| ~ pred_attacker(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f812,f599]) ).
fof(f1253,plain,
! [X0,X1] :
( ~ pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(constr_neg(X0))
| pred_attacker(X1) ),
inference(superposition,[],[f789,f795]) ).
fof(f1502,plain,
( ~ pred_attacker(constr_neg(name_Na))
| pred_attacker(name_Sa)
| ~ spl0_12 ),
inference(resolution,[],[f1253,f1130]) ).
fof(f1523,plain,
( ~ pred_attacker(constr_neg(name_Na))
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f1502,f636]) ).
fof(f1529,plain,
! [X0,X1] :
( pred_attacker(constr_add(X0,constr_ZERO))
| ~ pred_attacker(constr_add(X0,X1))
| ~ pred_attacker(constr_neg(X1)) ),
inference(superposition,[],[f774,f552]) ).
fof(f1560,plain,
! [X0,X1] :
( ~ pred_attacker(constr_add(X0,X1))
| pred_attacker(X0)
| ~ pred_attacker(constr_neg(X1)) ),
inference(forward_demodulation,[],[f1529,f553]) ).
fof(f1568,plain,
( ! [X0] :
( pred_attacker(constr_neg(name_Na))
| ~ pred_attacker(constr_neg(constr_adec(X0,name_skA)))
| ~ pred_attacker(X0) )
| ~ spl0_5 ),
inference(resolution,[],[f1560,f1193]) ).
fof(f1587,plain,
( ! [X0] :
( ~ pred_attacker(constr_neg(constr_adec(X0,name_skA)))
| ~ pred_attacker(X0) )
| ~ spl0_5
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f1568,f1523]) ).
fof(f1593,plain,
( ! [X0] :
( ~ pred_attacker(constr_adec(X0,name_skA))
| ~ pred_attacker(X0) )
| ~ spl0_5
| ~ spl0_12 ),
inference(resolution,[],[f1587,f566]) ).
fof(f1599,plain,
( ! [X0] :
( ~ pred_attacker(constr_aenc(X0,constr_pkey(name_skA)))
| ~ pred_attacker(X0) )
| ~ spl0_5
| ~ spl0_12 ),
inference(superposition,[],[f1593,f551]) ).
fof(f1606,definition,
( spl0_17
<=> ! [X0] : ~ pred_attacker(X0) ),
introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).
fof(f1607,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_17 ),
inference(avatar_component_clause,[],[f1606]) ).
fof(f1724,plain,
( ! [X0] :
( ~ pred_attacker(X0)
| ~ pred_attacker(X0)
| ~ pred_attacker(constr_pkey(name_skA)) )
| ~ spl0_5
| ~ spl0_12 ),
inference(resolution,[],[f1599,f610]) ).
fof(f1726,plain,
( ! [X0] :
( ~ pred_attacker(X0)
| ~ pred_attacker(constr_pkey(name_skA)) )
| ~ spl0_5
| ~ spl0_12 ),
inference(duplicate_literal_removal,[],[f1724]) ).
fof(f1728,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_5
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[],[f1726,f657]) ).
fof(f1729,plain,
( spl0_17
| ~ spl0_5
| ~ spl0_12 ),
inference(avatar_split_clause,[],[f1728,f1128,f811,f1606]) ).
fof(f1730,plain,
( $false
| ~ spl0_17 ),
inference(resolution,[],[f1607,f618]) ).
fof(f1809,plain,
~ spl0_17,
inference(avatar_contradiction_clause,[],[f1730]) ).
fof(f1818,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_1 ),
inference(resolution,[],[f639,f608]) ).
fof(f1819,plain,
( spl0_17
| ~ spl0_1 ),
inference(avatar_split_clause,[],[f1818,f638,f1606]) ).
fof(f1824,plain,
( ! [X0,X1] :
( ~ pred_attacker(tuple_client_A_in_2(X0))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_neg(name_Na),constr_adec(X1,name_skA))))
| ~ pred_attacker(X0)
| ~ pred_attacker(X1) )
| ~ spl0_2 ),
inference(resolution,[],[f804,f603]) ).
fof(f1825,plain,
( ! [X0,X1] :
( ~ pred_attacker(tuple_client_A_in_2(X0))
| pred_attacker(tuple_client_A_out_5(constr_add(constr_neg(name_Na),constr_adec(X1,name_skA))))
| ~ pred_attacker(X1) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f1824,f607]) ).
fof(f1826,plain,
( spl0_5
| spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f1825,f641,f645,f811]) ).
fof(f1827,plain,
( ! [X0] :
( ~ pred_attacker(X0)
| ~ pred_attacker(constr_pkey(X0)) )
| ~ spl0_13 ),
inference(resolution,[],[f1133,f608]) ).
fof(f1828,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f1827,f557]) ).
fof(f1829,plain,
( spl0_17
| ~ spl0_13 ),
inference(avatar_split_clause,[],[f1828,f1132,f1606]) ).
cnf(s1,plain,
( spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f643]) ).
cnf(s2,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f650]) ).
cnf(s24,plain,
~ spl0_3,
inference(sat_conversion,[],[f723]) ).
cnf(s95,plain,
( ~ spl0_4
| spl0_12
| spl0_13 ),
inference(sat_conversion,[],[f1134]) ).
cnf(s98,plain,
( ~ spl0_5
| ~ spl0_12
| spl0_17 ),
inference(sat_conversion,[],[f1729]) ).
cnf(s121,plain,
~ spl0_17,
inference(sat_conversion,[],[f1809]) ).
cnf(s123,plain,
( ~ spl0_1
| spl0_17 ),
inference(sat_conversion,[],[f1819]) ).
cnf(s126,plain,
( ~ spl0_2
| spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f1826]) ).
cnf(s127,plain,
( ~ spl0_13
| spl0_17 ),
inference(sat_conversion,[],[f1829]) ).
cnf(s128,plain,
~ spl0_13,
inference(rat,[],[s127,s121]) ).
cnf(s129,plain,
~ spl0_1,
inference(rat,[],[s123,s121]) ).
cnf(s130,plain,
( ~ spl0_5
| ~ spl0_12 ),
inference(rat,[],[s98,s121]) ).
cnf(s132,plain,
( ~ spl0_4
| spl0_12 ),
inference(rat,[],[s95,s128]) ).
cnf(s136,plain,
spl0_4,
inference(rat,[],[s2,s24]) ).
cnf(s137,plain,
spl0_12,
inference(rat,[],[s132,s136]) ).
cnf(s138,plain,
~ spl0_5,
inference(rat,[],[s130,s137]) ).
cnf(s139,plain,
~ spl0_2,
inference(rat,[],[s126,s24,s138]) ).
cnf(s140,plain,
$false,
inference(rat,[],[s1,s139,s129]) ).
fof(f1830,plain,
$false,
inference(avatar_sat_refutation,[],[s140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWW958+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Mon Sep 28 14:48:34 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.13 Running first-order model finding
% 0.08/0.13 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.08/0.17 % (3430451)Will run a generic schedule for satisfiability detection.
% 0.08/0.17 % (3430457)% WARNING: option uhcvi not known.
% 0.08/0.17 % (3430460)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2974684380:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.17 % (3430458)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1187314061:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.17 % (3430456)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1764800381_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.17 % (3430457)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2694236844:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.17 % (3430459)dis+10_1_sil=32000:sp=arity:random_seed=1283957800:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.17 % (3430461)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1030974815:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.17 % (3430462)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2947300079:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.17 % Detected minimum model sizes of [20]
% 0.08/0.17 % Detected maximum model sizes of [max]
% 0.08/0.17 % TRYING [20]
% 0.08/0.17 % (3430459) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3430451-3430459"...
% 0.08/0.17 % (3430459)...printing done.
% 0.08/0.17 % (3430459)Refutation found. Thanks to Tanya!
% 0.08/0.17 % SZS status Theorem for theBenchmark
% 0.08/0.17 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.18 % (3430459)------------------------------
% 0.08/0.18 % (3430459)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.18 % (3430459)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.18 % (3430459)CaDiCaL version: 2.1.3
% 0.08/0.18 % (3430459)Termination reason: Refutation
% 0.08/0.18 % (3430459)Time elapsed: 0.015 s
% 0.08/0.18 % (3430459)Peak memory usage: 13 MB
% 0.08/0.18 % (3430459)Instructions burned: 43 (million)
% 0.08/0.18 % (3430451)Success in time 0.041 s
% 0.08/0.18 % Vampire exiting
%------------------------------------------------------------------------------