↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWW950+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.19s 0.27s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   66 (  19 unt;   4 def)
%            Number of atoms       :  127 (   5 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  124 (  63   ~;  49   |;   2   &)
%                                         (   4 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   5 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f47,axiom,
    ! [X0] : constr_xor(X0,constr_ZERO) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).

fof(f48,axiom,
    ! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).

fof(f54,axiom,
    pred_attacker(constr_ZERO),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax53) ).

fof(f56,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_out_4(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).

fof(f58,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_out_2(X0))
     => pred_attacker(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax57) ).

fof(f59,axiom,
    ! [X0,X1] :
      ( ( pred_attacker(X0)
        & pred_attacker(X1) )
     => pred_attacker(tuple_T_in_3(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).

fof(f62,axiom,
    ! [X0] :
      ( pred_attacker(X0)
     => pred_attacker(tuple_T_in_1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax61) ).

fof(f74,axiom,
    ! [X0] :
      ( pred_attacker(tuple_T_in_1(X0))
     => pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax73) ).

fof(f75,axiom,
    ! [X0,X1] :
      ( ( pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
        & pred_attacker(tuple_T_in_1(X1)) )
     => pred_attacker(tuple_T_out_4(name_objective)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax74) ).

fof(f76,conjecture,
    pred_attacker(name_objective),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).

fof(f77,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(negated_conjecture,[status(cth)],[f76]) ).

fof(f78,plain,
    ~ pred_attacker(name_objective),
    inference(flattening,[],[f77]) ).

fof(f84,plain,
    ! [X0] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_T_out_4(X0)) ),
    inference(ennf_transformation,[],[f56]) ).

fof(f86,plain,
    ! [X0] :
      ( pred_attacker(X0)
      | ~ pred_attacker(tuple_T_out_2(X0)) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f87,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_T_in_3(X0,X1))
      | ~ pred_attacker(X0)
      | ~ pred_attacker(X1) ),
    inference(ennf_transformation,[],[f59]) ).

fof(f88,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_T_in_3(X0,X1))
      | ~ pred_attacker(X0)
      | ~ pred_attacker(X1) ),
    inference(flattening,[],[f87]) ).

fof(f91,plain,
    ! [X0] :
      ( pred_attacker(tuple_T_in_1(X0))
      | ~ pred_attacker(X0) ),
    inference(ennf_transformation,[],[f62]) ).

fof(f97,plain,
    ! [X0] :
      ( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(tuple_T_in_1(X0)) ),
    inference(ennf_transformation,[],[f74]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_T_out_4(name_objective))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(tuple_T_in_1(X1)) ),
    inference(ennf_transformation,[],[f75]) ).

fof(f99,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_T_out_4(name_objective))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(tuple_T_in_1(X1)) ),
    inference(flattening,[],[f98]) ).

fof(f146,plain,
    ! [X0] : constr_xor(X0,constr_ZERO) = X0,
    inference(cnf_transformation,[],[f47]) ).

fof(f147,plain,
    ! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
    inference(cnf_transformation,[],[f48]) ).

fof(f153,plain,
    pred_attacker(constr_ZERO),
    inference(cnf_transformation,[],[f54]) ).

fof(f155,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_4(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f157,plain,
    ! [X0] :
      ( ~ pred_attacker(tuple_T_out_2(X0))
      | pred_attacker(X0) ),
    inference(cnf_transformation,[],[f86]) ).

fof(f158,plain,
    ! [X0,X1] :
      ( pred_attacker(tuple_T_in_3(X0,X1))
      | ~ pred_attacker(X0)
      | ~ pred_attacker(X1) ),
    inference(cnf_transformation,[],[f88]) ).

fof(f161,plain,
    ! [X0] :
      ( pred_attacker(tuple_T_in_1(X0))
      | ~ pred_attacker(X0) ),
    inference(cnf_transformation,[],[f91]) ).

fof(f172,plain,
    ! [X0] :
      ( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | ~ pred_attacker(tuple_T_in_1(X0)) ),
    inference(cnf_transformation,[],[f97]) ).

fof(f173,plain,
    ! [X0,X1] :
      ( ~ pred_attacker(tuple_T_in_1(X1))
      | ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
      | pred_attacker(tuple_T_out_4(name_objective)) ),
    inference(cnf_transformation,[],[f99]) ).

fof(f174,plain,
    ~ pred_attacker(name_objective),
    inference(cnf_transformation,[],[f78]) ).

fof(f176,definition,
    ( spl0_1
  <=> pred_attacker(tuple_T_out_4(name_objective)) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f178,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f176]) ).

fof(f180,definition,
    ( spl0_2
  <=> ! [X0] : ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f181,plain,
    ( ! [X0] : ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f180]) ).

fof(f183,definition,
    ( spl0_3
  <=> ! [X1] : ~ pred_attacker(tuple_T_in_1(X1)) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f184,plain,
    ( ! [X1] : ~ pred_attacker(tuple_T_in_1(X1))
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f183]) ).

fof(f185,plain,
    ( spl0_1
    | spl0_2
    | spl0_3 ),
    inference(avatar_split_clause,[],[f173,f183,f180,f176]) ).

fof(f192,plain,
    ! [X0] : constr_xor(constr_ZERO,X0) = X0,
    inference(superposition,[],[f146,f147]) ).

fof(f205,plain,
    ( ! [X0] :
        ( ~ pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))
        | ~ pred_attacker(X0) )
    | ~ spl0_2 ),
    inference(resolution,[],[f181,f158]) ).

fof(f244,plain,
    ! [X0] :
      ( pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))
      | ~ pred_attacker(tuple_T_in_1(X0)) ),
    inference(resolution,[],[f172,f157]) ).

fof(f251,definition,
    ( spl0_6
  <=> pred_attacker(tuple_T_in_1(constr_ZERO)) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f252,plain,
    ( pred_attacker(tuple_T_in_1(constr_ZERO))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f253,plain,
    ( ~ pred_attacker(tuple_T_in_1(constr_ZERO))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f271,plain,
    ( ~ pred_attacker(constr_ZERO)
    | spl0_6 ),
    inference(resolution,[],[f253,f161]) ).

fof(f272,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f271,f153]) ).

fof(f273,plain,
    spl0_6,
    inference(avatar_contradiction_clause,[],[f272]) ).

fof(f307,plain,
    ( ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
    | ~ pred_attacker(constr_ZERO)
    | ~ spl0_2 ),
    inference(superposition,[],[f205,f192]) ).

fof(f309,plain,
    ( ~ pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f307,f153]) ).

fof(f375,plain,
    ( pred_attacker(constr_h(constr_xor(name_k0x30,name_ki)))
    | ~ pred_attacker(tuple_T_in_1(constr_ZERO)) ),
    inference(superposition,[],[f244,f192]) ).

fof(f377,plain,
    ( ~ pred_attacker(tuple_T_in_1(constr_ZERO))
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f375,f309]) ).

fof(f381,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f377,f252]) ).

fof(f382,plain,
    ( ~ spl0_2
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f381]) ).

fof(f385,plain,
    ( $false
    | ~ spl0_3
    | ~ spl0_6 ),
    inference(resolution,[],[f184,f252]) ).

fof(f386,plain,
    ( ~ spl0_3
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f385]) ).

fof(f388,plain,
    ( pred_attacker(name_objective)
    | ~ spl0_1 ),
    inference(resolution,[],[f178,f155]) ).

fof(f389,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f388,f174]) ).

fof(f390,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f389]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f185]) ).

cnf(s6,plain,
    spl0_6,
    inference(sat_conversion,[],[f273]) ).

cnf(s9,plain,
    ( ~ spl0_2
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f382]) ).

cnf(s11,plain,
    ( ~ spl0_3
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f386]) ).

cnf(s12,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f390]) ).

cnf(s13,plain,
    ~ spl0_3,
    inference(rat,[],[s11,s6]) ).

cnf(s14,plain,
    ~ spl0_2,
    inference(rat,[],[s9,s6]) ).

cnf(s16,plain,
    $false,
    inference(rat,[],[s1,s13,s14,s12]) ).

fof(f391,plain,
    $false,
    inference(avatar_sat_refutation,[],[s16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW950+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18  % Computer : n013.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Mon Sep 28 14:47:06 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22  Running first-order model finding
% 0.09/0.22  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.19/0.27  % (1235760)Will run a generic schedule for satisfiability detection.
% 0.19/0.27  % (1235765)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2705936508_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.27  % Detected minimum model sizes of [10]
% 0.19/0.27  % Detected maximum model sizes of [max]
% 0.19/0.27  % TRYING [10]
% 0.19/0.27  % (1235766)% WARNING: option uhcvi not known.
% 0.19/0.27  % (1235766)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3800098143:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.27  % (1235767)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=173927323:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.27  % (1235769)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1066912175:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.27  % (1235768)dis+10_1_sil=32000:sp=arity:random_seed=1168385482:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.27  % (1235770)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4243216:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.27  % (1235771)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=817429293:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.27  % (1235769) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1235760-1235769"...
% 0.19/0.27  % (1235766) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1235760-1235766"...
% 0.19/0.27  % (1235768) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1235760-1235768"...
% 0.19/0.27  % (1235769)...printing done.
% 0.19/0.27  % (1235766)...printing done.
% 0.19/0.27  % (1235768)...printing done.
% 0.19/0.27  % (1235769)Refutation found. Thanks to Tanya!
% 0.19/0.27  % SZS status Theorem for theBenchmark
% 0.19/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.27  % (1235769)------------------------------
% 0.19/0.27  % (1235769)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.27  % (1235769)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.27  % (1235769)CaDiCaL version: 2.1.3
% 0.19/0.27  % (1235769)Termination reason: Refutation
% 0.19/0.27  % (1235769)Time elapsed: 0.007 s
% 0.19/0.27  % (1235769)Peak memory usage: 12 MB
% 0.19/0.27  % (1235769)Instructions burned: 9 (million)
% 0.19/0.27  % (1235760)Success in time 0.044 s
% 0.19/0.27  % Vampire exiting
%------------------------------------------------------------------------------