↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN633-1 : TPTP v9.3.1. Released v2.5.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 02:17:46 PM UTC 2026

% Result   : Unsatisfiable 0.10s 0.24s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   29 (   8 unt;   2 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  21   ~;  29   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    7 (   6 usr;   3 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;   7 con; 0-3 aty)
%            Number of variables   :   23 (   0 sgn  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f7,negated_conjecture,
    ~ p3(c23,f8(c24)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p3_7) ).

fof(f8,negated_conjecture,
    ! [X2,X0,X1] : p3(f4(f6(X0,f7(X1,X2))),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_8) ).

fof(f17,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p3(X2,X0)
      | p3(X0,X1)
      | ~ p3(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_17) ).

fof(f25,negated_conjecture,
    ~ p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p10_25) ).

fof(f26,negated_conjecture,
    ! [X0] :
      ( ~ p22(X0,f16(f6(c25,f7(c23,c26))))
      | p21(f12(f13(c28,c29)),f12(f13(c28,X0))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21_26) ).

fof(f33,negated_conjecture,
    ! [X2,X0,X1] :
      ( p22(f17(X0,X1,X2),f16(X0))
      | p3(f4(X0),f8(c24))
      | p10(f11(X0,c27,X1),f11(X0,c27,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_33) ).

fof(f38,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p21(f12(f13(X1,X2)),f12(f13(X1,f17(X0,X1,X2))))
      | p10(f11(X0,c27,X1),f11(X0,c27,X2))
      | p3(f4(X0),f8(c24)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_38) ).

fof(f51,plain,
    ! [X2,X3,X0,X1] :
      ( ~ p3(f4(f6(X2,f7(X0,X3))),X1)
      | p3(X0,X1) ),
    inference(resolution,[],[f17,f8]) ).

fof(f111,plain,
    ! [X0,X1] :
      ( p3(f4(f6(c25,f7(c23,c26))),f8(c24))
      | p10(f11(f6(c25,f7(c23,c26)),c27,X0),f11(f6(c25,f7(c23,c26)),c27,X1))
      | p21(f12(f13(c28,c29)),f12(f13(c28,f17(f6(c25,f7(c23,c26)),X0,X1)))) ),
    inference(resolution,[],[f33,f26]) ).

fof(f114,definition,
    ( spl0_1
  <=> ! [X0,X1] :
        ( p10(f11(f6(c25,f7(c23,c26)),c27,X0),f11(f6(c25,f7(c23,c26)),c27,X1))
        | p21(f12(f13(c28,c29)),f12(f13(c28,f17(f6(c25,f7(c23,c26)),X0,X1)))) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f115,plain,
    ( ! [X0,X1] :
        ( p21(f12(f13(c28,c29)),f12(f13(c28,f17(f6(c25,f7(c23,c26)),X0,X1))))
        | p10(f11(f6(c25,f7(c23,c26)),c27,X0),f11(f6(c25,f7(c23,c26)),c27,X1)) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f114]) ).

fof(f117,definition,
    ( spl0_2
  <=> p3(f4(f6(c25,f7(c23,c26))),f8(c24)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f118,plain,
    ( ~ p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f117]) ).

fof(f119,plain,
    ( p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f117]) ).

fof(f120,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f111,f117,f114]) ).

fof(f121,plain,
    ( p3(c23,f8(c24))
    | ~ spl0_2 ),
    inference(resolution,[],[f119,f51]) ).

fof(f128,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f121,f7]) ).

fof(f129,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f128]) ).

fof(f235,plain,
    ( p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))
    | p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))
    | p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | ~ spl0_1 ),
    inference(resolution,[],[f115,f38]) ).

fof(f237,plain,
    ( p10(f11(f6(c25,f7(c23,c26)),c27,c28),f11(f6(c25,f7(c23,c26)),c27,c29))
    | p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | ~ spl0_1 ),
    inference(duplicate_literal_removal,[],[f235]) ).

fof(f238,plain,
    ( p3(f4(f6(c25,f7(c23,c26))),f8(c24))
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f237,f25]) ).

fof(f239,plain,
    ( $false
    | ~ spl0_1
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f238,f118]) ).

fof(f240,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_contradiction_clause,[],[f239]) ).

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

cnf(s2,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f129]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f240]) ).

cnf(s4,plain,
    ~ spl0_1,
    inference(rat,[],[s3,s2]) ).

cnf(s5,plain,
    $false,
    inference(rat,[],[s1,s2,s4]) ).

fof(f241,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN633-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17  % Computer : n013.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Mon Sep 28 16:37:21 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  Running first-order model finding
% 0.10/0.20  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.10/0.24  % (1316401)Will run a generic schedule for satisfiability detection.
% 0.10/0.24  % (1316407)% WARNING: option uhcvi not known.
% 0.10/0.24  % (1316406)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=695666300_3000 on theBenchmark for (3000ds/0Mi)
% 0.10/0.24  % (1316409)dis+10_1_sil=32000:sp=arity:random_seed=408939538:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.10/0.24  % (1316407)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1634739813:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.10/0.24  % (1316408)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3930384893:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.10/0.24  % (1316410)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2550250566:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.10/0.24  % (1316411)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2963607099:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.10/0.24  % (1316412)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=358062005:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.10/0.24  % TRYING [1]
% 0.10/0.24  % TRYING [2]
% 0.10/0.24  % (1316411) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1316401-1316411"...
% 0.10/0.24  % (1316411)...printing done.
% 0.10/0.24  % (1316407) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1316401-1316407"...
% 0.10/0.24  % (1316411)Refutation found. Thanks to Tanya!
% 0.10/0.24  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.24  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.24  % (1316411)------------------------------
% 0.10/0.24  % (1316411)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.24  % (1316411)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.24  % (1316411)CaDiCaL version: 2.1.3
% 0.10/0.24  % (1316411)Termination reason: Refutation
% 0.10/0.24  % (1316411)Time elapsed: 0.007 s
% 0.10/0.24  % (1316411)Peak memory usage: 12 MB
% 0.10/0.24  % (1316411)Instructions burned: 9 (million)
% 0.10/0.24  % (1316401)Success in time 0.032 s
% 0.10/0.24  % Vampire exiting
%------------------------------------------------------------------------------