TSTP Solution File: KRS003_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : KRS003_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n011.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 : Mon May 20 23:19:42 EDT 2024

% Result   : Theorem 0.60s 0.82s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   56 (   6 unt;  15 typ;   0 def)
%            Number of atoms       :   93 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  102 (  50   ~;  38   |;   6   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   14 (  12   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   45 (  45   !;   0   ?;  45   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    unreal: $tType ).

tff(type_def_6,type,
    real: $tType ).

tff(func_def_0,type,
    u1r1: unreal > real ).

tff(func_def_1,type,
    u1r2: unreal > real ).

tff(func_def_2,type,
    u3r1: unreal > real ).

tff(func_def_3,type,
    u3r2: unreal > real ).

tff(func_def_4,type,
    exist: unreal ).

tff(pred_def_1,type,
    f: unreal > $o ).

tff(pred_def_2,type,
    d: unreal > $o ).

tff(pred_def_3,type,
    e: unreal > $o ).

tff(pred_def_4,type,
    s1most: unreal > $o ).

tff(pred_def_5,type,
    s: ( unreal * real ) > $o ).

tff(pred_def_6,type,
    c: unreal > $o ).

tff(pred_def_7,type,
    equalish: ( real * real ) > $o ).

tff(pred_def_8,type,
    s2least: unreal > $o ).

tff(f71,plain,
    $false,
    inference(subsumption_resolution,[],[f70,f34]) ).

tff(f34,plain,
    e(exist),
    inference(cnf_transformation,[],[f19]) ).

tff(f19,plain,
    ( f(exist)
    & e(exist) ),
    inference(ennf_transformation,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ( ~ f(exist)
      | ~ e(exist) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ( ~ f(exist)
    | ~ e(exist) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1__clause_2) ).

tff(f70,plain,
    ~ e(exist),
    inference(resolution,[],[f67,f37]) ).

tff(f37,plain,
    ! [X0: unreal] :
      ( c(X0)
      | ~ e(X0) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ! [X0: unreal] :
      ( c(X0)
      | ~ e(X0) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f13,axiom,
    ! [X0: unreal] :
      ( e(X0)
     => c(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_15) ).

tff(f67,plain,
    ~ c(exist),
    inference(resolution,[],[f63,f41]) ).

tff(f41,plain,
    ! [X0: unreal] :
      ( s2least(X0)
      | ~ c(X0) ),
    inference(cnf_transformation,[],[f25]) ).

tff(f25,plain,
    ! [X0: unreal] :
      ( s2least(X0)
      | ~ c(X0) ),
    inference(ennf_transformation,[],[f1]) ).

tff(f1,axiom,
    ! [X0: unreal] :
      ( c(X0)
     => s2least(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

tff(f63,plain,
    ~ s2least(exist),
    inference(subsumption_resolution,[],[f62,f48]) ).

tff(f48,plain,
    ! [X0: unreal] :
      ( s(X0,u1r1(X0))
      | ~ s2least(X0) ),
    inference(cnf_transformation,[],[f32]) ).

tff(f32,plain,
    ! [X0: unreal] :
      ( s(X0,u1r1(X0))
      | ~ s2least(X0) ),
    inference(ennf_transformation,[],[f4]) ).

tff(f4,axiom,
    ! [X0: unreal] :
      ( s2least(X0)
     => s(X0,u1r1(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

tff(f62,plain,
    ( ~ s(exist,u1r1(exist))
    | ~ s2least(exist) ),
    inference(duplicate_literal_removal,[],[f61]) ).

tff(f61,plain,
    ( ~ s(exist,u1r1(exist))
    | ~ s2least(exist)
    | ~ s2least(exist) ),
    inference(resolution,[],[f57,f47]) ).

tff(f47,plain,
    ! [X0: unreal] :
      ( s(X0,u1r2(X0))
      | ~ s2least(X0) ),
    inference(cnf_transformation,[],[f31]) ).

tff(f31,plain,
    ! [X0: unreal] :
      ( s(X0,u1r2(X0))
      | ~ s2least(X0) ),
    inference(ennf_transformation,[],[f5]) ).

tff(f5,axiom,
    ! [X0: unreal] :
      ( s2least(X0)
     => s(X0,u1r2(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

tff(f57,plain,
    ! [X0: unreal] :
      ( ~ s(exist,u1r2(X0))
      | ~ s(exist,u1r1(X0))
      | ~ s2least(X0) ),
    inference(resolution,[],[f55,f49]) ).

tff(f49,plain,
    ! [X0: unreal] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ s2least(X0) ),
    inference(cnf_transformation,[],[f33]) ).

tff(f33,plain,
    ! [X0: unreal] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ s2least(X0) ),
    inference(ennf_transformation,[],[f3]) ).

tff(f3,axiom,
    ! [X0: unreal] :
      ~ ( equalish(u1r2(X0),u1r1(X0))
        & s2least(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

tff(f55,plain,
    ! [X0: real,X1: real] :
      ( equalish(X0,X1)
      | ~ s(exist,X1)
      | ~ s(exist,X0) ),
    inference(resolution,[],[f54,f35]) ).

tff(f35,plain,
    f(exist),
    inference(cnf_transformation,[],[f19]) ).

tff(f54,plain,
    ! [X2: real,X0: unreal,X1: real] :
      ( ~ f(X0)
      | equalish(X1,X2)
      | ~ s(X0,X2)
      | ~ s(X0,X1) ),
    inference(resolution,[],[f52,f36]) ).

tff(f36,plain,
    ! [X0: unreal] :
      ( d(X0)
      | ~ f(X0) ),
    inference(cnf_transformation,[],[f20]) ).

tff(f20,plain,
    ! [X0: unreal] :
      ( d(X0)
      | ~ f(X0) ),
    inference(ennf_transformation,[],[f14]) ).

tff(f14,axiom,
    ! [X0: unreal] :
      ( f(X0)
     => d(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_16) ).

tff(f52,plain,
    ! [X2: real,X0: unreal,X1: real] :
      ( ~ d(X0)
      | ~ s(X0,X2)
      | equalish(X2,X1)
      | ~ s(X0,X1) ),
    inference(resolution,[],[f45,f39]) ).

tff(f39,plain,
    ! [X0: unreal] :
      ( s1most(X0)
      | ~ d(X0) ),
    inference(cnf_transformation,[],[f23]) ).

tff(f23,plain,
    ! [X0: unreal] :
      ( s1most(X0)
      | ~ d(X0) ),
    inference(ennf_transformation,[],[f7]) ).

tff(f7,axiom,
    ! [X0: unreal] :
      ( d(X0)
     => s1most(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

tff(f45,plain,
    ! [X2: unreal,X0: real,X1: real] :
      ( ~ s1most(X2)
      | ~ s(X2,X0)
      | ~ s(X2,X1)
      | equalish(X1,X0) ),
    inference(cnf_transformation,[],[f28]) ).

tff(f28,plain,
    ! [X0: real,X1: real,X2: unreal] :
      ( equalish(X1,X0)
      | ~ s(X2,X0)
      | ~ s(X2,X1)
      | ~ s1most(X2) ),
    inference(flattening,[],[f27]) ).

tff(f27,plain,
    ! [X0: real,X1: real,X2: unreal] :
      ( equalish(X1,X0)
      | ~ s(X2,X0)
      | ~ s(X2,X1)
      | ~ s1most(X2) ),
    inference(ennf_transformation,[],[f17]) ).

tff(f17,plain,
    ! [X0: real,X1: real,X2: unreal] :
      ( ( s(X2,X0)
        & s(X2,X1)
        & s1most(X2) )
     => equalish(X1,X0) ),
    inference(rectify,[],[f9]) ).

tff(f9,axiom,
    ! [X1: real,X2: real,X0: unreal] :
      ( ( s(X0,X1)
        & s(X0,X2)
        & s1most(X0) )
     => equalish(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_11) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : KRS003_1 : TPTP v8.2.0. Released v5.0.0.
% 0.13/0.16  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.37  % Computer : n011.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Sat May 18 22:24:53 EDT 2024
% 0.15/0.38  % CPUTime    : 
% 0.15/0.38  This is a TF0_THM_NEQ_NAR problem
% 0.15/0.38  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.82  % (25732)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.82  % (25733)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.82  % (25732)Refutation not found, incomplete strategy% (25732)------------------------------
% 0.60/0.82  % (25732)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25732)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  
% 0.60/0.82  % (25732)Memory used [KB]: 953
% 0.60/0.82  % (25732)Time elapsed: 0.002 s
% 0.60/0.82  % (25732)Instructions burned: 2 (million)
% 0.60/0.82  % (25728)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.82  % (25726)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.82  % (25727)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.82  % (25730)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.82  % (25732)------------------------------
% 0.60/0.82  % (25732)------------------------------
% 0.60/0.82  % (25731)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.82  % (25729)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.82  % (25733)Refutation not found, incomplete strategy% (25733)------------------------------
% 0.60/0.82  % (25733)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25733)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  
% 0.60/0.82  % (25733)Memory used [KB]: 952
% 0.60/0.82  % (25726)Refutation not found, incomplete strategy% (25726)------------------------------
% 0.60/0.82  % (25726)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25726)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  
% 0.60/0.82  % (25726)Memory used [KB]: 945
% 0.60/0.82  % (25726)Time elapsed: 0.002 s
% 0.60/0.82  % (25726)Instructions burned: 2 (million)
% 0.60/0.82  % (25733)Time elapsed: 0.003 s
% 0.60/0.82  % (25733)Instructions burned: 2 (million)
% 0.60/0.82  % (25729)Refutation not found, incomplete strategy% (25729)------------------------------
% 0.60/0.82  % (25729)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25729)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  
% 0.60/0.82  % (25729)Memory used [KB]: 945
% 0.60/0.82  % (25729)Time elapsed: 0.002 s
% 0.60/0.82  % (25729)Instructions burned: 2 (million)
% 0.60/0.82  % (25726)------------------------------
% 0.60/0.82  % (25726)------------------------------
% 0.60/0.82  % (25733)------------------------------
% 0.60/0.82  % (25733)------------------------------
% 0.60/0.82  % (25731)Refutation not found, incomplete strategy% (25731)------------------------------
% 0.60/0.82  % (25731)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25731)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  
% 0.60/0.82  % (25731)Memory used [KB]: 948
% 0.60/0.82  % (25731)Time elapsed: 0.002 s
% 0.60/0.82  % (25731)Instructions burned: 2 (million)
% 0.60/0.82  % (25729)------------------------------
% 0.60/0.82  % (25729)------------------------------
% 0.60/0.82  % (25730)Refutation not found, incomplete strategy% (25730)------------------------------
% 0.60/0.82  % (25730)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25730)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82  % (25731)------------------------------
% 0.60/0.82  % (25731)------------------------------
% 0.60/0.82  
% 0.60/0.82  % (25730)Memory used [KB]: 954
% 0.60/0.82  % (25730)Time elapsed: 0.002 s
% 0.60/0.82  % (25730)Instructions burned: 2 (million)
% 0.60/0.82  % (25730)------------------------------
% 0.60/0.82  % (25730)------------------------------
% 0.60/0.82  % (25728)First to succeed.
% 0.60/0.82  % (25727)Also succeeded, but the first one will report.
% 0.60/0.82  % (25728)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25724"
% 0.60/0.82  % (25728)Refutation found. Thanks to Tanya!
% 0.60/0.82  % SZS status Theorem for theBenchmark
% 0.60/0.82  % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.82  % (25728)------------------------------
% 0.60/0.82  % (25728)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.82  % (25728)Termination reason: Refutation
% 0.60/0.82  
% 0.60/0.82  % (25728)Memory used [KB]: 979
% 0.60/0.82  % (25728)Time elapsed: 0.004 s
% 0.60/0.82  % (25728)Instructions burned: 4 (million)
% 0.60/0.82  % (25724)Success in time 0.424 s
% 0.60/0.82  % Vampire---4.8 exiting
%------------------------------------------------------------------------------