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

% Computer : n011.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 11:42:16 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.46s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   27 (   5 unt;   0 def)
%            Number of atoms       :  135 (  18 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :  169 (  61   ~;  55   |;  46   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   69 (  49   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f12,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cc(X1) )
        & ? [X1] :
            ( rr(X0,X1)
            & cd(X1) )
        & ! [X2,X3] :
            ( ( rr(X0,X2)
              & rr(X0,X3) )
           => X2 = X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(f13,axiom,
    ! [X0] :
      ( cc(X0)
     => ~ cd(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(f14,axiom,
    cUnsatisfiable(i2003_11_14_17_20_18265),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(f15,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cc(X1) )
        & ? [X2] :
            ( rr(X0,X2)
            & cd(X2) )
        & ! [X3,X4] :
            ( ( rr(X0,X3)
              & rr(X0,X4) )
           => X3 = X4 ) ) ),
    inference(rectify,[],[f12]) ).

fof(f34,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cc(X1) )
        & ? [X2] :
            ( rr(X0,X2)
            & cd(X2) )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X3)
            | ~ rr(X0,X4) ) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f35,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cc(X1) )
        & ? [X2] :
            ( rr(X0,X2)
            & cd(X2) )
        & ! [X3,X4] :
            ( X3 = X4
            | ~ rr(X0,X3)
            | ~ rr(X0,X4) ) ) ),
    inference(flattening,[],[f34]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ cd(X0)
      | ~ cc(X0) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f38,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cc(X1) )
        | ! [X2] :
            ( ~ rr(X0,X2)
            | ~ cd(X2) )
        | ? [X3,X4] :
            ( X3 != X4
            & rr(X0,X3)
            & rr(X0,X4) ) )
      & ( ( ? [X1] :
              ( rr(X0,X1)
              & cc(X1) )
          & ? [X2] :
              ( rr(X0,X2)
              & cd(X2) )
          & ! [X3,X4] :
              ( X3 = X4
              | ~ rr(X0,X3)
              | ~ rr(X0,X4) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(nnf_transformation,[],[f35]) ).

fof(f39,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cc(X1) )
        | ! [X2] :
            ( ~ rr(X0,X2)
            | ~ cd(X2) )
        | ? [X3,X4] :
            ( X3 != X4
            & rr(X0,X3)
            & rr(X0,X4) ) )
      & ( ( ? [X1] :
              ( rr(X0,X1)
              & cc(X1) )
          & ? [X2] :
              ( rr(X0,X2)
              & cd(X2) )
          & ! [X3,X4] :
              ( X3 = X4
              | ~ rr(X0,X3)
              | ~ rr(X0,X4) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(flattening,[],[f38]) ).

fof(f40,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cc(X1) )
        | ! [X2] :
            ( ~ rr(X0,X2)
            | ~ cd(X2) )
        | ? [X3,X4] :
            ( X3 != X4
            & rr(X0,X3)
            & rr(X0,X4) ) )
      & ( ( ? [X5] :
              ( rr(X0,X5)
              & cc(X5) )
          & ? [X6] :
              ( rr(X0,X6)
              & cd(X6) )
          & ! [X7,X8] :
              ( X7 = X8
              | ~ rr(X0,X7)
              | ~ rr(X0,X8) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(rectify,[],[f39]) ).

fof(f41,plain,
    ! [X0] :
      ( ( cUnsatisfiable(X0)
        | ! [X1] :
            ( ~ rr(X0,X1)
            | ~ cc(X1) )
        | ! [X2] :
            ( ~ rr(X0,X2)
            | ~ cd(X2) )
        | ( sK0(X0) != sK1(X0)
          & rr(X0,sK0(X0))
          & rr(X0,sK1(X0)) ) )
      & ( ( rr(X0,sK2(X0))
          & cc(sK2(X0))
          & rr(X0,sK3(X0))
          & cd(sK3(X0))
          & ! [X7,X8] :
              ( X7 = X8
              | ~ rr(X0,X7)
              | ~ rr(X0,X8) ) )
        | ~ cUnsatisfiable(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X3,sK0(X0)),skolemize(X4,sK1(X0)),skolemize(X5,sK2(X0)),skolemize(X6,sK3(X0))],[f40]) ).

fof(f55,plain,
    ! [X0,X8,X7] :
      ( ~ rr(X0,X8)
      | ~ rr(X0,X7)
      | X7 = X8
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f56,plain,
    ! [X0] :
      ( cd(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f57,plain,
    ! [X0] :
      ( rr(X0,sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f58,plain,
    ! [X0] :
      ( cc(sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f59,plain,
    ! [X0] :
      ( rr(X0,sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f63,plain,
    ! [X0] :
      ( ~ cd(X0)
      | ~ cc(X0) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f64,plain,
    cUnsatisfiable(i2003_11_14_17_20_18265),
    inference(cnf_transformation,[],[f14]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ cc(sK3(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f56,f63]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | sK2(X0) = X1
      | ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f55,f59]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | sK2(X0) = X1
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f77]) ).

fof(f80,plain,
    ! [X0] :
      ( sK2(X0) = sK3(X0)
      | ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f78,f57]) ).

fof(f83,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | sK2(X0) = sK3(X0) ),
    inference(duplicate_literal_removal,[],[f80]) ).

fof(f86,plain,
    sK2(i2003_11_14_17_20_18265) = sK3(i2003_11_14_17_20_18265),
    inference(resolution,[],[f83,f64]) ).

fof(f90,plain,
    ( ~ cc(sK2(i2003_11_14_17_20_18265))
    | ~ cUnsatisfiable(i2003_11_14_17_20_18265) ),
    inference(superposition,[],[f75,f86]) ).

fof(f93,plain,
    ~ cUnsatisfiable(i2003_11_14_17_20_18265),
    inference(forward_subsumption_resolution,[],[f90,f58]) ).

fof(f94,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f93,f64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS096+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n011.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 13:23:00 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.46  % (2409486)Will run a generic schedule for satisfiability detection.
% 0.11/0.46  % (2409491)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2892073298_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.46  % TRYING [1]
% 0.11/0.46  % TRYING [2]
% 0.11/0.46  % TRYING [3]
% 0.11/0.46  % TRYING [4]
% 0.11/0.46  % TRYING [5]
% 0.11/0.46  % TRYING [6]
% 0.11/0.46  % TRYING [7]
% 0.11/0.46  % TRYING [8]
% 0.11/0.46  % TRYING [9]
% 0.11/0.46  % TRYING [10]
% 0.11/0.46  % TRYING [11]
% 0.11/0.46  % (2409492)% WARNING: option uhcvi not known.
% 0.11/0.46  % TRYING [12]
% 0.11/0.46  % TRYING [13]
% 0.11/0.46  % TRYING [14]
% 0.11/0.46  % TRYING [15]
% 0.11/0.46  % TRYING [16]
% 0.11/0.46  % (2409495)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2417070919:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46  % (2409492)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=536383588:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.46  % (2409493)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2005162192:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.46  % (2409494)dis+10_1_sil=32000:sp=arity:random_seed=3613011859:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.46  % (2409496)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=968905037:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.46  % TRYING [17]
% 0.11/0.46  % (2409497)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2743089407:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.46  % TRYING [18]
% 0.11/0.46  % (2409495) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409495"...
% 0.11/0.46  % (2409494) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409494"...
% 0.11/0.46  % (2409492) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409492"...
% 0.11/0.46  % TRYING [19]
% 0.11/0.46  % (2409496) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409496"...
% 0.11/0.46  % (2409497) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409497"...
% 0.11/0.46  % (2409495)...printing done.
% 0.11/0.46  % (2409494)...printing done.
% 0.11/0.46  % TRYING [20]
% 0.11/0.46  % (2409492)...printing done.
% 0.11/0.46  % (2409493) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2409486-2409493"...
% 0.11/0.46  % (2409496)...printing done.
% 0.11/0.46  % (2409497)...printing done.
% 0.11/0.46  % (2409494)Refutation found. Thanks to Tanya!
% 0.11/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46  % (2409494)------------------------------
% 0.11/0.46  % (2409494)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46  % (2409494)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46  % (2409494)CaDiCaL version: 2.1.3
% 0.11/0.46  % (2409494)Termination reason: Refutation
% 0.11/0.46  % (2409494)Time elapsed: 0.002 s
% 0.11/0.46  % (2409494)Peak memory usage: 11 MB
% 0.11/0.46  % (2409494)Instructions burned: 2 (million)
% 0.11/0.46  % (2409486)Success in time 0.041 s
% 0.11/0.46  % Vampire exiting
%------------------------------------------------------------------------------