%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW962+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.09s 0.25s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 18 unt; 2 def)
% Number of atoms : 42 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 16 ~; 9 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f83,axiom,
! [X0,X1,X2] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax82) ).
fof(f87,axiom,
! [X0,X1] : constr_assoc_pair_2_get_0x30(tuple_assoc_pair(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax86) ).
fof(f145,axiom,
! [X0,X1] :
( pred_attacker(tuple_assoc_pair(X0,X1))
=> pred_attacker(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax144) ).
fof(f152,axiom,
pred_attacker(constr_CONST_0x30),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax151) ).
fof(f177,conjecture,
! [X0] : pred_attacker(tuple_2(name_Nb(X0),name_objective)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f178,negated_conjecture,
~ ! [X0] : pred_attacker(tuple_2(name_Nb(X0),name_objective)),
inference(negated_conjecture,[status(cth)],[f177]) ).
fof(f241,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_assoc_pair(X0,X1)) ),
inference(ennf_transformation,[],[f145]) ).
fof(f266,plain,
? [X0] : ~ pred_attacker(tuple_2(name_Nb(X0),name_objective)),
inference(ennf_transformation,[],[f178]) ).
fof(f349,plain,
! [X2,X0,X1] : tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2)) = tuple_assoc_pair(tuple_assoc_pair(X0,X1),X2),
inference(cnf_transformation,[],[f83]) ).
fof(f353,plain,
! [X0,X1] : constr_assoc_pair_2_get_0x30(tuple_assoc_pair(X0,X1)) = X0,
inference(cnf_transformation,[],[f87]) ).
fof(f411,plain,
! [X0,X1] :
( ~ pred_attacker(tuple_assoc_pair(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f241]) ).
fof(f418,plain,
pred_attacker(constr_CONST_0x30),
inference(cnf_transformation,[],[f152]) ).
fof(f442,plain,
~ pred_attacker(tuple_2(name_Nb(sK0),name_objective)),
inference(cnf_transformation,[],[f266]) ).
fof(f669,plain,
! [X2,X0,X1] : tuple_assoc_pair(X0,X1) = constr_assoc_pair_2_get_0x30(tuple_assoc_pair(X0,tuple_assoc_pair(X1,X2))),
inference(superposition,[],[f353,f349]) ).
fof(f673,plain,
! [X0,X1] : tuple_assoc_pair(X0,X1) = X0,
inference(forward_demodulation,[],[f669,f353]) ).
fof(f688,plain,
! [X0,X1] :
( ~ pred_attacker(X0)
| pred_attacker(X1) ),
inference(superposition,[],[f411,f673]) ).
fof(f692,definition,
( spl1_5
<=> ! [X1] : pred_attacker(X1) ),
introduced(definition,[new_symbols(definition,[spl1_5])],[avatar_definition]) ).
fof(f693,plain,
( ! [X1] : pred_attacker(X1)
| ~ spl1_5 ),
inference(avatar_component_clause,[],[f692]) ).
fof(f695,definition,
( spl1_6
<=> ! [X0] : ~ pred_attacker(X0) ),
introduced(definition,[new_symbols(definition,[spl1_6])],[avatar_definition]) ).
fof(f696,plain,
( ! [X0] : ~ pred_attacker(X0)
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f695]) ).
fof(f697,plain,
( spl1_5
| spl1_6 ),
inference(avatar_split_clause,[],[f688,f695,f692]) ).
fof(f703,plain,
( $false
| ~ spl1_6 ),
inference(resolution,[],[f696,f418]) ).
fof(f779,plain,
~ spl1_6,
inference(avatar_contradiction_clause,[],[f703]) ).
fof(f785,plain,
( $false
| ~ spl1_5 ),
inference(resolution,[],[f693,f442]) ).
fof(f811,plain,
~ spl1_5,
inference(avatar_contradiction_clause,[],[f785]) ).
cnf(s62,plain,
( spl1_5
| spl1_6 ),
inference(sat_conversion,[],[f697]) ).
cnf(s84,plain,
~ spl1_6,
inference(sat_conversion,[],[f779]) ).
cnf(s86,plain,
~ spl1_5,
inference(sat_conversion,[],[f811]) ).
cnf(s87,plain,
$false,
inference(rat,[],[s62,s84,s86]) ).
fof(f812,plain,
$false,
inference(avatar_sat_refutation,[],[s87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW962+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.09/0.17 % Computer : n018.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 14:51:25 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.21 Running first-order model finding
% 0.09/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.09/0.25 % (3446803)Will run a generic schedule for satisfiability detection.
% 0.09/0.25 % (3446814)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=640453400:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.25 % (3446811)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1178894090:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.25 % (3446809)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=607447876_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.25 % (3446813)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2734929894:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.25 % (3446812)dis+10_1_sil=32000:sp=arity:random_seed=1609599607:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.25 % (3446815)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3862682878:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.25 % (3446810)% WARNING: option uhcvi not known.
% 0.09/0.25 % (3446810)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1980611682:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.25 % Detected minimum model sizes of [13]
% 0.09/0.25 % (3446813) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3446803-3446813"...
% 0.09/0.25 % Detected maximum model sizes of [max]
% 0.09/0.25 % TRYING [13]
% 0.09/0.25 % (3446812) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3446803-3446812"...
% 0.09/0.25 % (3446813)...printing done.
% 0.09/0.25 % (3446812)...printing done.
% 0.09/0.25 % (3446813)Refutation found. Thanks to Tanya!
% 0.09/0.25 % SZS status Theorem for theBenchmark
% 0.09/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.25 % (3446813)------------------------------
% 0.09/0.25 % (3446813)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.25 % (3446813)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.25 % (3446813)CaDiCaL version: 2.1.3
% 0.09/0.25 % (3446813)Termination reason: Refutation
% 0.09/0.25 % (3446813)Time elapsed: 0.009 s
% 0.09/0.25 % (3446813)Peak memory usage: 12 MB
% 0.09/0.25 % (3446813)Instructions burned: 13 (million)
% 0.09/0.25 % (3446803)Success in time 0.036 s
% 0.09/0.25 % Vampire exiting
%------------------------------------------------------------------------------