TSTP Solution File: SWC044-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC044-1 : TPTP v8.2.0. Released v2.4.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n026.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 : Tue May 21 04:35:47 EDT 2024

% Result   : Unsatisfiable 0.54s 0.75s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   23 (  15 unt;   0 def)
%            Number of atoms       :   40 (   8 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   41 (  24   ~;  16   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    8 (   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f236,plain,
    $false,
    inference(subsumption_resolution,[],[f235,f196]) ).

fof(f196,plain,
    ssList(sk3),
    inference(definition_unfolding,[],[f186,f192]) ).

fof(f192,axiom,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f186,axiom,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

fof(f235,plain,
    ~ ssList(sk3),
    inference(resolution,[],[f202,f230]) ).

fof(f230,plain,
    ~ rearsegP(sk3,sk4),
    inference(subsumption_resolution,[],[f229,f193]) ).

fof(f193,axiom,
    rearsegP(sk4,sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f229,plain,
    ( ~ rearsegP(sk4,sk3)
    | ~ rearsegP(sk3,sk4) ),
    inference(subsumption_resolution,[],[f228,f196]) ).

fof(f228,plain,
    ( ~ ssList(sk3)
    | ~ rearsegP(sk4,sk3)
    | ~ rearsegP(sk3,sk4) ),
    inference(subsumption_resolution,[],[f227,f197]) ).

fof(f197,plain,
    ssList(sk4),
    inference(definition_unfolding,[],[f187,f191]) ).

fof(f191,axiom,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

fof(f187,axiom,
    ssList(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).

fof(f227,plain,
    ( ~ ssList(sk4)
    | ~ ssList(sk3)
    | ~ rearsegP(sk4,sk3)
    | ~ rearsegP(sk3,sk4) ),
    inference(resolution,[],[f213,f214]) ).

fof(f214,plain,
    ! [X0,X1] :
      ( sQ0_eqProxy(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ rearsegP(X1,X0)
      | ~ rearsegP(X0,X1) ),
    inference(equality_proxy_replacement,[],[f128,f212]) ).

fof(f212,plain,
    ! [X0,X1] :
      ( sQ0_eqProxy(X0,X1)
    <=> X0 = X1 ),
    introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).

fof(f128,axiom,
    ! [X0,X1] :
      ( X0 = X1
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ rearsegP(X1,X0)
      | ~ rearsegP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause128) ).

fof(f213,plain,
    ~ sQ0_eqProxy(sk3,sk4),
    inference(equality_proxy_replacement,[],[f198,f212]) ).

fof(f198,plain,
    sk3 != sk4,
    inference(definition_unfolding,[],[f194,f195,f192]) ).

fof(f195,plain,
    nil = sk4,
    inference(definition_unfolding,[],[f190,f191]) ).

fof(f190,axiom,
    nil = sk2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

fof(f194,axiom,
    nil != sk1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

fof(f202,plain,
    ! [X0] :
      ( rearsegP(X0,sk4)
      | ~ ssList(X0) ),
    inference(definition_unfolding,[],[f58,f195]) ).

fof(f58,axiom,
    ! [X0] :
      ( rearsegP(X0,nil)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause58) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SWC044-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 03:41:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.14/0.35  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.54/0.75  % (3070)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 (2996ds/56Mi)
% 0.54/0.75  % (3063)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 (2996ds/34Mi)
% 0.54/0.75  % (3064)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 (2996ds/51Mi)
% 0.54/0.75  % (3065)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.75  % (3070)First to succeed.
% 0.54/0.75  % (3066)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.75  % (3067)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 (2996ds/34Mi)
% 0.54/0.75  % (3068)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.75  % (3069)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 (2996ds/83Mi)
% 0.54/0.75  % (3070)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3041"
% 0.54/0.75  % (3070)Refutation found. Thanks to Tanya!
% 0.54/0.75  % SZS status Unsatisfiable for theBenchmark
% 0.54/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.75  % (3070)------------------------------
% 0.54/0.75  % (3070)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (3070)Termination reason: Refutation
% 0.54/0.75  
% 0.54/0.75  % (3070)Memory used [KB]: 1188
% 0.54/0.75  % (3070)Time elapsed: 0.002 s
% 0.54/0.75  % (3070)Instructions burned: 4 (million)
% 0.54/0.75  % (3041)Success in time 0.391 s
% 0.54/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------