TSTP Solution File: KRS013-1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 07:19:18 EDT 2024

% Result   : Unsatisfiable 0.22s 0.38s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   38 (  11 unt;   0 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   75 (  29   ~;  46   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f103,plain,
    $false,
    inference(subsumption_resolution,[],[f102,f82]) ).

fof(f82,plain,
    t2least(u6r1(exist)),
    inference(resolution,[],[f81,f3]) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ c(X0)
      | t2least(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

fof(f81,plain,
    c(u6r1(exist)),
    inference(subsumption_resolution,[],[f80,f2]) ).

fof(f2,axiom,
    ~ f(exist),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

fof(f80,plain,
    ( c(u6r1(exist))
    | f(exist) ),
    inference(resolution,[],[f79,f1]) ).

fof(f1,axiom,
    e(exist),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

fof(f79,plain,
    ! [X0] :
      ( ~ e(X0)
      | c(u6r1(X0))
      | f(X0) ),
    inference(duplicate_literal_removal,[],[f76]) ).

fof(f76,plain,
    ! [X0] :
      ( f(X0)
      | c(u6r1(X0))
      | ~ e(X0)
      | f(X0) ),
    inference(resolution,[],[f75,f40]) ).

fof(f40,plain,
    ! [X0] :
      ( ~ s2least(u6r1(X0))
      | c(u6r1(X0))
      | ~ e(X0)
      | f(X0) ),
    inference(resolution,[],[f16,f29]) ).

fof(f29,axiom,
    ! [X0] :
      ( r(X0,u6r1(X0))
      | f(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_29) ).

fof(f16,axiom,
    ! [X2,X0] :
      ( ~ r(X0,X2)
      | ~ e(X0)
      | c(X2)
      | ~ s2least(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).

fof(f75,plain,
    ! [X0] :
      ( s2least(u6r1(X0))
      | f(X0) ),
    inference(resolution,[],[f74,f28]) ).

fof(f28,axiom,
    ! [X0] :
      ( ~ s1most(u6r1(X0))
      | f(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_28) ).

fof(f74,plain,
    ! [X0] :
      ( s1most(X0)
      | s2least(X0) ),
    inference(subsumption_resolution,[],[f72,f31]) ).

fof(f31,axiom,
    ! [X0] :
      ( ~ equalish(u7r2(X0),u7r1(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_31) ).

fof(f72,plain,
    ! [X0] :
      ( s2least(X0)
      | equalish(u7r2(X0),u7r1(X0))
      | s1most(X0) ),
    inference(duplicate_literal_removal,[],[f71]) ).

fof(f71,plain,
    ! [X0] :
      ( s2least(X0)
      | equalish(u7r2(X0),u7r1(X0))
      | s1most(X0)
      | s1most(X0) ),
    inference(resolution,[],[f51,f33]) ).

fof(f33,axiom,
    ! [X0] :
      ( s(X0,u7r2(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_33) ).

fof(f51,plain,
    ! [X0,X1] :
      ( ~ s(X0,X1)
      | s2least(X0)
      | equalish(X1,u7r1(X0))
      | s1most(X0) ),
    inference(resolution,[],[f26,f32]) ).

fof(f32,axiom,
    ! [X0] :
      ( s(X0,u7r1(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_32) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ s(X0,X2)
      | s2least(X0)
      | ~ s(X0,X1)
      | equalish(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_26) ).

fof(f102,plain,
    ~ t2least(u6r1(exist)),
    inference(resolution,[],[f98,f5]) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ t2least(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

fof(f98,plain,
    equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))),
    inference(resolution,[],[f93,f83]) ).

fof(f83,plain,
    t(u6r1(exist),u1r2(u6r1(exist))),
    inference(resolution,[],[f82,f7]) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ t2least(X0)
      | t(X0,u1r2(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

fof(f93,plain,
    ! [X0] :
      ( ~ t(u6r1(exist),X0)
      | equalish(X0,u1r1(u6r1(exist))) ),
    inference(subsumption_resolution,[],[f91,f38]) ).

fof(f38,plain,
    t1most(u6r1(exist)),
    inference(resolution,[],[f37,f9]) ).

fof(f9,axiom,
    ! [X0] :
      ( ~ d(X0)
      | t1most(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

fof(f37,plain,
    d(u6r1(exist)),
    inference(subsumption_resolution,[],[f36,f2]) ).

fof(f36,plain,
    ( d(u6r1(exist))
    | f(exist) ),
    inference(resolution,[],[f34,f1]) ).

fof(f34,plain,
    ! [X0] :
      ( ~ e(X0)
      | d(u6r1(X0))
      | f(X0) ),
    inference(resolution,[],[f15,f29]) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( ~ r(X0,X1)
      | d(X1)
      | ~ e(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).

fof(f91,plain,
    ! [X0] :
      ( ~ t1most(u6r1(exist))
      | ~ t(u6r1(exist),X0)
      | equalish(X0,u1r1(u6r1(exist))) ),
    inference(resolution,[],[f84,f11]) ).

fof(f11,axiom,
    ! [X2,X0,X1] :
      ( ~ t(X0,X2)
      | ~ t1most(X0)
      | ~ t(X0,X1)
      | equalish(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).

fof(f84,plain,
    t(u6r1(exist),u1r1(u6r1(exist))),
    inference(resolution,[],[f82,f6]) ).

fof(f6,axiom,
    ! [X0] :
      ( ~ t2least(X0)
      | t(X0,u1r1(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : KRS013-1 : TPTP v8.1.2. Released v2.0.0.
% 0.14/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n004.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 19:53:23 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (11657)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (11662)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.22/0.38  % (11663)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.22/0.38  % (11659)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.38  % (11658)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (11664)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.22/0.38  % (11660)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.22/0.38  % (11661)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [1]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [2]
% 0.22/0.38  TRYING [1,1,1]
% 0.22/0.38  TRYING [1,1,1]
% 0.22/0.38  % (11662)First to succeed.
% 0.22/0.38  TRYING [2,2,1]
% 0.22/0.38  TRYING [2,2,1]
% 0.22/0.38  TRYING [3]
% 0.22/0.38  % (11663)Also succeeded, but the first one will report.
% 0.22/0.38  TRYING [3]
% 0.22/0.38  TRYING [2,1,2]
% 0.22/0.38  % (11662)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11657"
% 0.22/0.38  % (11660)Also succeeded, but the first one will report.
% 0.22/0.38  TRYING [2,1,2]
% 0.22/0.38  TRYING [2,2,2]
% 0.22/0.38  TRYING [2,2,2]
% 0.22/0.38  % (11662)Refutation found. Thanks to Tanya!
% 0.22/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.22/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.38  % (11662)------------------------------
% 0.22/0.38  % (11662)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.38  % (11662)Termination reason: Refutation
% 0.22/0.38  
% 0.22/0.38  % (11662)Memory used [KB]: 761
% 0.22/0.38  % (11662)Time elapsed: 0.004 s
% 0.22/0.38  % (11662)Instructions burned: 4 (million)
% 0.22/0.38  % (11657)Success in time 0.02 s
%------------------------------------------------------------------------------