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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC011-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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n017.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:33 EDT 2024

% Result   : Unsatisfiable 0.58s 0.73s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   24 (  10 unt;   0 def)
%            Number of atoms       :   55 (  15 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   68 (  37   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :    9 (   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f412,plain,
    $false,
    inference(subsumption_resolution,[],[f411,f226]) ).

fof(f226,plain,
    ssItem(sk5),
    inference(subsumption_resolution,[],[f201,f224]) ).

fof(f224,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f208]) ).

fof(f208,plain,
    ( neq(sk4,nil)
    | neq(sk4,nil) ),
    inference(definition_unfolding,[],[f192,f190,f190]) ).

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

fof(f192,axiom,
    ( neq(sk2,nil)
    | neq(sk2,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f201,axiom,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

fof(f411,plain,
    ~ ssItem(sk5),
    inference(subsumption_resolution,[],[f410,f227]) ).

fof(f227,plain,
    ssList(sk6),
    inference(subsumption_resolution,[],[f202,f224]) ).

fof(f202,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

fof(f410,plain,
    ( ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(subsumption_resolution,[],[f409,f228]) ).

fof(f228,plain,
    ssList(sk7),
    inference(subsumption_resolution,[],[f203,f224]) ).

fof(f203,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

fof(f409,plain,
    ( ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(subsumption_resolution,[],[f405,f230]) ).

fof(f230,plain,
    sk3 = app(sk6,sk7),
    inference(subsumption_resolution,[],[f205,f224]) ).

fof(f205,axiom,
    ( ~ neq(sk4,nil)
    | sk3 = app(sk6,sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_20) ).

fof(f405,plain,
    ( sk3 != app(sk6,sk7)
    | ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(trivial_inequality_removal,[],[f403]) ).

fof(f403,plain,
    ( sk4 != sk4
    | sk3 != app(sk6,sk7)
    | ~ ssList(sk7)
    | ~ ssList(sk6)
    | ~ ssItem(sk5) ),
    inference(superposition,[],[f225,f229]) ).

fof(f229,plain,
    sk4 = app(app(sk6,cons(sk5,nil)),sk7),
    inference(subsumption_resolution,[],[f204,f224]) ).

fof(f204,axiom,
    ( ~ neq(sk4,nil)
    | sk4 = app(app(sk6,cons(sk5,nil)),sk7) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).

fof(f225,plain,
    ! [X8,X6,X7] :
      ( sk4 != app(app(X7,cons(X6,nil)),X8)
      | sk3 != app(X7,X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | ~ ssItem(X6) ),
    inference(subsumption_resolution,[],[f216,f224]) ).

fof(f216,plain,
    ! [X8,X6,X7] :
      ( ~ neq(sk4,nil)
      | sk3 != app(X7,X8)
      | sk4 != app(app(X7,cons(X6,nil)),X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | ~ ssItem(X6) ),
    inference(definition_unfolding,[],[f200,f191,f190]) ).

fof(f191,axiom,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f200,axiom,
    ! [X8,X6,X7] :
      ( ~ neq(sk4,nil)
      | sk1 != app(X7,X8)
      | sk2 != app(app(X7,cons(X6,nil)),X8)
      | ~ ssList(X8)
      | ~ ssList(X7)
      | ~ ssItem(X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWC011-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13  % 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.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sun May 19 02:55:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.14/0.34  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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.51/0.73  % (3333)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.51/0.73  % (3328)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.51/0.73  % (3330)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.51/0.73  % (3329)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.51/0.73  % (3333)First to succeed.
% 0.51/0.73  % (3328)Also succeeded, but the first one will report.
% 0.51/0.73  % (3330)Also succeeded, but the first one will report.
% 0.58/0.73  % (3333)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3327"
% 0.58/0.73  % (3333)Refutation found. Thanks to Tanya!
% 0.58/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.58/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.74  % (3333)------------------------------
% 0.58/0.74  % (3333)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.74  % (3333)Termination reason: Refutation
% 0.58/0.74  
% 0.58/0.74  % (3333)Memory used [KB]: 1241
% 0.58/0.74  % (3333)Time elapsed: 0.005 s
% 0.58/0.74  % (3333)Instructions burned: 9 (million)
% 0.58/0.74  % (3327)Success in time 0.385 s
% 0.58/0.74  % Vampire---4.8 exiting
%------------------------------------------------------------------------------