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

% Computer : n008.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:18 AM UTC 2026

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   62 (   9 unt;   0 def)
%            Number of atoms       :  150 (  20 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  138 (  50   ~;  63   |;  13   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   94 (  86   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ! [X0] :
      ( cowlThing(X0)
      & ~ cowlNothing(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_0) ).

fof(f19,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rf2(X0,X1)
            & cp2(X1) )
        & ? [X1] :
            ( rf1(X0,X1)
            & cp1(X1) )
        & ? [X1] :
            ( rr(X0,X1)
            & cowlThing(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f20,axiom,
    ! [X0] :
      ( cp1(X0)
     => cp2xcomp(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f21,axiom,
    ! [X0] :
      ( cp2(X0)
    <=> ~ ? [X1] : ra_Px1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f22,axiom,
    ! [X0] :
      ( cp2xcomp(X0)
    <=> ? [X1] : ra_Px1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f23,axiom,
    ! [X0] :
      ( cowlThing(X0)
     => ! [X1,X2] :
          ( ( rf1(X0,X1)
            & rf1(X0,X2) )
         => X1 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(f24,axiom,
    ! [X0] :
      ( cowlThing(X0)
     => ! [X1,X2] :
          ( ( rf2(X0,X1)
            & rf2(X0,X2) )
         => X1 = X2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(f25,axiom,
    cUnsatisfiable(i2003_11_14_17_21_30578),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f26,axiom,
    ! [X0,X1] :
      ( rr(X0,X1)
     => rf2(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(f27,axiom,
    ! [X0,X1] :
      ( rr(X0,X1)
     => rf1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).

fof(f28,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rf2(X0,X1)
            & cp2(X1) )
        & ? [X2] :
            ( rf1(X0,X2)
            & cp1(X2) )
        & ? [X3] :
            ( rr(X0,X3)
            & cowlThing(X3) ) ) ),
    inference(rectify,[],[f19]) ).

fof(f61,plain,
    ! [X0] :
      ( cp2xcomp(X0)
      | ~ cp1(X0) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f62,plain,
    ! [X0] :
      ( cp2(X0)
    <=> ! [X1] : ~ ra_Px1(X0,X1) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f63,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( X1 = X2
          | ~ rf1(X0,X1)
          | ~ rf1(X0,X2) )
      | ~ cowlThing(X0) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f64,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( X1 = X2
          | ~ rf1(X0,X1)
          | ~ rf1(X0,X2) )
      | ~ cowlThing(X0) ),
    inference(flattening,[],[f63]) ).

fof(f65,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( X1 = X2
          | ~ rf2(X0,X1)
          | ~ rf2(X0,X2) )
      | ~ cowlThing(X0) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f66,plain,
    ! [X0] :
      ( ! [X1,X2] :
          ( X1 = X2
          | ~ rf2(X0,X1)
          | ~ rf2(X0,X2) )
      | ~ cowlThing(X0) ),
    inference(flattening,[],[f65]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( rf2(X0,X1)
      | ~ rr(X0,X1) ),
    inference(ennf_transformation,[],[f26]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( rf1(X0,X1)
      | ~ rr(X0,X1) ),
    inference(ennf_transformation,[],[f27]) ).

fof(f86,plain,
    ! [X0] : cowlThing(X0),
    inference(cnf_transformation,[],[f17]) ).

fof(f89,plain,
    ! [X0] :
      ( cp2(sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f90,plain,
    ! [X0] :
      ( rf2(X0,sK2(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f92,plain,
    ! [X0] :
      ( cp1(sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f93,plain,
    ! [X0] :
      ( rf1(X0,sK1(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f95,plain,
    ! [X0] :
      ( rr(X0,sK0(X0))
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f28]) ).

fof(f96,plain,
    ! [X0] :
      ( ~ cp1(X0)
      | cp2xcomp(X0) ),
    inference(cnf_transformation,[],[f61]) ).

fof(f98,plain,
    ! [X0,X1] :
      ( ~ ra_Px1(X0,X1)
      | ~ cp2(X0) ),
    inference(cnf_transformation,[],[f62]) ).

fof(f100,plain,
    ! [X0] :
      ( ra_Px1(X0,sK4(X0))
      | ~ cp2xcomp(X0) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f101,plain,
    ! [X2,X0,X1] :
      ( ~ cowlThing(X0)
      | ~ rf1(X0,X2)
      | ~ rf1(X0,X1)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f64]) ).

fof(f102,plain,
    ! [X2,X0,X1] :
      ( ~ cowlThing(X0)
      | ~ rf2(X0,X2)
      | ~ rf2(X0,X1)
      | X1 = X2 ),
    inference(cnf_transformation,[],[f66]) ).

fof(f103,plain,
    cUnsatisfiable(i2003_11_14_17_21_30578),
    inference(cnf_transformation,[],[f25]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | rf2(X0,X1) ),
    inference(cnf_transformation,[],[f67]) ).

fof(f105,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | rf1(X0,X1) ),
    inference(cnf_transformation,[],[f68]) ).

fof(f131,plain,
    ! [X0] :
      ( rr(X0,sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f95]) ).

fof(f133,plain,
    ! [X0] :
      ( rf1(X0,sK1(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f93]) ).

fof(f134,plain,
    ! [X0] :
      ( ~ cp1(sK1(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f92]) ).

fof(f136,plain,
    ! [X0] :
      ( ~ rf2(X0,sK2(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f90]) ).

fof(f137,plain,
    ! [X0] :
      ( cp2(sK2(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f89]) ).

fof(f138,plain,
    ! [X0] :
      ( cp2xcomp(X0)
      | cp1(X0) ),
    inference(consistent_polarity_flipping,[],[f96]) ).

fof(f139,plain,
    ! [X2,X0,X1] :
      ( ~ cowlThing(X0)
      | rf2(X0,X2)
      | rf2(X0,X1)
      | X1 = X2 ),
    inference(consistent_polarity_flipping,[],[f102]) ).

fof(f140,plain,
    ~ cUnsatisfiable(i2003_11_14_17_21_30578),
    inference(consistent_polarity_flipping,[],[f103]) ).

fof(f141,plain,
    ! [X0,X1] :
      ( ~ rf2(X0,X1)
      | ~ rr(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f104]) ).

fof(f145,plain,
    ! [X0] :
      ( ~ cp2(X0)
      | ~ cp2xcomp(X0) ),
    inference(resolution,[],[f100,f98]) ).

fof(f146,plain,
    ! [X0] :
      ( ~ cp2xcomp(sK2(X0))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f145,f137]) ).

fof(f147,plain,
    ! [X0] :
      ( rf1(X0,sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f131,f105]) ).

fof(f149,plain,
    ! [X0] :
      ( cp1(sK2(X0))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f146,f138]) ).

fof(f150,plain,
    ! [X2,X0,X1] :
      ( ~ rf1(X0,X1)
      | ~ rf1(X0,X2)
      | X1 = X2 ),
    inference(forward_subsumption_resolution,[],[f101,f86]) ).

fof(f151,plain,
    ! [X0,X1] :
      ( ~ rf1(X0,X1)
      | sK1(X0) = X1
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f150,f133]) ).

fof(f153,plain,
    ! [X2,X0,X1] :
      ( rf2(X0,X2)
      | rf2(X0,X1)
      | X1 = X2 ),
    inference(forward_subsumption_resolution,[],[f139,f86]) ).

fof(f154,plain,
    ! [X0,X1] :
      ( rf2(X0,X1)
      | sK2(X0) = X1
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f153,f136]) ).

fof(f161,plain,
    ! [X0] :
      ( sK0(X0) = sK1(X0)
      | cUnsatisfiable(X0)
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f151,f147]) ).

fof(f162,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | sK0(X0) = sK1(X0) ),
    inference(duplicate_literal_removal,[],[f161]) ).

fof(f164,plain,
    sK0(i2003_11_14_17_21_30578) = sK1(i2003_11_14_17_21_30578),
    inference(resolution,[],[f162,f140]) ).

fof(f167,plain,
    ! [X0,X1] :
      ( ~ rr(X0,X1)
      | cUnsatisfiable(X0)
      | sK2(X0) = X1 ),
    inference(resolution,[],[f154,f141]) ).

fof(f171,plain,
    ( ~ cp1(sK0(i2003_11_14_17_21_30578))
    | cUnsatisfiable(i2003_11_14_17_21_30578) ),
    inference(superposition,[],[f134,f164]) ).

fof(f172,plain,
    ~ cp1(sK0(i2003_11_14_17_21_30578)),
    inference(forward_subsumption_resolution,[],[f171,f140]) ).

fof(f177,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | sK0(X0) = sK2(X0)
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f167,f131]) ).

fof(f178,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | sK0(X0) = sK2(X0) ),
    inference(duplicate_literal_removal,[],[f177]) ).

fof(f179,plain,
    sK0(i2003_11_14_17_21_30578) = sK2(i2003_11_14_17_21_30578),
    inference(resolution,[],[f178,f140]) ).

fof(f185,plain,
    ( cp1(sK0(i2003_11_14_17_21_30578))
    | cUnsatisfiable(i2003_11_14_17_21_30578) ),
    inference(superposition,[],[f149,f179]) ).

fof(f190,plain,
    cUnsatisfiable(i2003_11_14_17_21_30578),
    inference(forward_subsumption_resolution,[],[f185,f172]) ).

fof(f192,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f190,f140]) ).

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