↑ 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  : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n010.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 09:44:40 AM UTC 2026

% Result   : Theorem 0.21s 0.29s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   8 unt;   2 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   23 (  11   ~;   6   |;   1   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn   2   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f51,axiom,
    ( mtvisible(c_tptp_member3356_mt)
   => marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_51) ).

fof(f1132,conjecture,
    ? [X0] :
      ( mtvisible(c_tptp_member3356_mt)
     => marriagelicensedocument(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query101) ).

fof(f1133,negated_conjecture,
    ~ ? [X0] :
        ( mtvisible(c_tptp_member3356_mt)
       => marriagelicensedocument(X0) ),
    inference(negated_conjecture,[status(cth)],[f1132]) ).

fof(f1251,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(ennf_transformation,[],[f51]) ).

fof(f2022,plain,
    ! [X0] :
      ( ~ marriagelicensedocument(X0)
      & mtvisible(c_tptp_member3356_mt) ),
    inference(ennf_transformation,[],[f1133]) ).

fof(f2073,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ mtvisible(c_tptp_member3356_mt) ),
    inference(cnf_transformation,[],[f1251]) ).

fof(f3062,plain,
    mtvisible(c_tptp_member3356_mt),
    inference(cnf_transformation,[],[f2022]) ).

fof(f3063,plain,
    ! [X0] : ~ marriagelicensedocument(X0),
    inference(cnf_transformation,[],[f2022]) ).

fof(f3377,definition,
    ( spl0_69
  <=> mtvisible(c_tptp_member3356_mt) ),
    introduced(definition,[new_symbols(definition,[spl0_69])],[avatar_definition]) ).

fof(f3381,definition,
    ( spl0_70
  <=> marriagelicensedocument(c_tptpmarriagelicensedocument) ),
    introduced(definition,[new_symbols(definition,[spl0_70])],[avatar_definition]) ).

fof(f3383,plain,
    ( marriagelicensedocument(c_tptpmarriagelicensedocument)
    | ~ spl0_70 ),
    inference(avatar_component_clause,[],[f3381]) ).

fof(f3384,plain,
    ( ~ spl0_69
    | spl0_70 ),
    inference(avatar_split_clause,[],[f2073,f3381,f3377]) ).

fof(f3400,plain,
    spl0_69,
    inference(avatar_split_clause,[],[f3062,f3377]) ).

fof(f3401,plain,
    ( $false
    | ~ spl0_70 ),
    inference(forward_subsumption_resolution,[],[f3383,f3063]) ).

fof(f3402,plain,
    ~ spl0_70,
    inference(avatar_contradiction_clause,[],[f3401]) ).

cnf(s50,plain,
    ( ~ spl0_69
    | spl0_70 ),
    inference(sat_conversion,[],[f3384]) ).

cnf(s54,plain,
    spl0_69,
    inference(sat_conversion,[],[f3400]) ).

cnf(s55,plain,
    ~ spl0_70,
    inference(sat_conversion,[],[f3402]) ).

cnf(s56,plain,
    $false,
    inference(rat,[],[s50,s55,s54]) ).

fof(f3403,plain,
    $false,
    inference(avatar_sat_refutation,[],[s56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR051+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18  % Computer : n010.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 22:18:18 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22  Running first-order model finding
% 0.07/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.21/0.29  % (2424201)Will run a generic schedule for satisfiability detection.
% 0.21/0.29  % (2424206)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3046956888_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29  % (2424207)% WARNING: option uhcvi not known.
% 0.21/0.29  % (2424207)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1103001551:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29  % (2424209)dis+10_1_sil=32000:sp=arity:random_seed=3717331667:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29  % (2424208)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1791243231:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29  % (2424210)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1762366777:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29  % TRYING [1]
% 0.21/0.29  % TRYING [2]
% 0.21/0.29  % (2424212)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2679316755:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29  % (2424211)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1311002656:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29  % (2424209) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2424201-2424209"...
% 0.21/0.29  % TRYING [3]
% 0.21/0.29  % (2424207) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2424201-2424207"...
% 0.21/0.29  % (2424209)...printing done.
% 0.21/0.29  % (2424208) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2424201-2424208"...
% 0.21/0.29  % (2424209)Refutation found. Thanks to Tanya!
% 0.21/0.29  % SZS status Theorem for theBenchmark
% 0.21/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29  % (2424209)------------------------------
% 0.21/0.29  % (2424209)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29  % (2424209)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29  % (2424209)CaDiCaL version: 2.1.3
% 0.21/0.29  % (2424209)Termination reason: Refutation
% 0.21/0.29  % (2424209)Time elapsed: 0.012 s
% 0.21/0.29  % (2424209)Peak memory usage: 14 MB
% 0.21/0.29  % (2424209)Instructions burned: 20 (million)
% 0.21/0.29  % (2424201)Success in time 0.057 s
% 0.21/0.29  % Vampire exiting
%------------------------------------------------------------------------------