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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC380-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 : 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 : Tue May 21 04:38:34 EDT 2024

% Result   : Unsatisfiable 0.71s 0.90s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   36 (  15 unt;   0 def)
%            Number of atoms       :   79 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   92 (  49   ~;  43   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f375,plain,
    $false,
    inference(subsumption_resolution,[],[f374,f259]) ).

fof(f259,plain,
    memberP(sk3,sk5),
    inference(subsumption_resolution,[],[f258,f8]) ).

fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

fof(f258,plain,
    ( memberP(sk3,sk5)
    | ~ ssList(nil) ),
    inference(subsumption_resolution,[],[f243,f226]) ).

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

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

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

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

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

fof(f200,axiom,
    ( ~ neq(sk4,nil)
    | ssItem(sk5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f243,plain,
    ( memberP(sk3,sk5)
    | ~ ssItem(sk5)
    | ~ ssList(nil) ),
    inference(superposition,[],[f222,f228]) ).

fof(f228,plain,
    sk3 = cons(sk5,nil),
    inference(subsumption_resolution,[],[f202,f224]) ).

fof(f202,axiom,
    ( ~ neq(sk4,nil)
    | sk3 = cons(sk5,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).

fof(f222,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssItem(X1)
      | ~ ssList(X2) ),
    inference(duplicate_literal_removal,[],[f217]) ).

fof(f217,plain,
    ! [X2,X1] :
      ( memberP(cons(X1,X2),X1)
      | ~ ssItem(X1)
      | ~ ssItem(X1)
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f138]) ).

fof(f138,axiom,
    ! [X2,X0,X1] :
      ( memberP(cons(X1,X2),X0)
      | ~ ssItem(X0)
      | ~ ssItem(X1)
      | ~ ssList(X2)
      | X0 != X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause138) ).

fof(f374,plain,
    ~ memberP(sk3,sk5),
    inference(subsumption_resolution,[],[f372,f226]) ).

fof(f372,plain,
    ( ~ ssItem(sk5)
    | ~ memberP(sk3,sk5) ),
    inference(resolution,[],[f370,f276]) ).

fof(f276,plain,
    ! [X0] :
      ( memberP(sk4,X0)
      | ~ ssItem(X0)
      | ~ memberP(sk3,X0) ),
    inference(subsumption_resolution,[],[f275,f227]) ).

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

fof(f201,axiom,
    ( ~ neq(sk4,nil)
    | ssList(sk6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f275,plain,
    ! [X0] :
      ( memberP(sk4,X0)
      | ~ ssItem(X0)
      | ~ ssList(sk6)
      | ~ memberP(sk3,X0) ),
    inference(subsumption_resolution,[],[f263,f204]) ).

fof(f204,plain,
    ssList(sk3),
    inference(definition_unfolding,[],[f186,f191]) ).

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

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

fof(f263,plain,
    ! [X0] :
      ( memberP(sk4,X0)
      | ~ ssItem(X0)
      | ~ ssList(sk3)
      | ~ ssList(sk6)
      | ~ memberP(sk3,X0) ),
    inference(superposition,[],[f140,f230]) ).

fof(f230,plain,
    sk4 = app(sk3,sk6),
    inference(forward_demodulation,[],[f229,f228]) ).

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

fof(f203,axiom,
    ( ~ neq(sk4,nil)
    | sk4 = app(cons(sk5,nil),sk6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

fof(f140,axiom,
    ! [X2,X0,X1] :
      ( memberP(app(X0,X2),X1)
      | ~ ssItem(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | ~ memberP(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause140) ).

fof(f370,plain,
    ~ memberP(sk4,sk5),
    inference(subsumption_resolution,[],[f369,f226]) ).

fof(f369,plain,
    ( ~ memberP(sk4,sk5)
    | ~ ssItem(sk5) ),
    inference(trivial_inequality_removal,[],[f367]) ).

fof(f367,plain,
    ( sk3 != sk3
    | ~ memberP(sk4,sk5)
    | ~ ssItem(sk5) ),
    inference(superposition,[],[f225,f228]) ).

fof(f225,plain,
    ! [X6] :
      ( sk3 != cons(X6,nil)
      | ~ memberP(sk4,X6)
      | ~ ssItem(X6) ),
    inference(subsumption_resolution,[],[f213,f224]) ).

fof(f213,plain,
    ! [X6] :
      ( ~ neq(sk4,nil)
      | ~ memberP(sk4,X6)
      | sk3 != cons(X6,nil)
      | ~ ssItem(X6) ),
    inference(definition_unfolding,[],[f199,f190,f191]) ).

fof(f199,axiom,
    ! [X6] :
      ( ~ neq(sk4,nil)
      | ~ memberP(sk2,X6)
      | sk1 != cons(X6,nil)
      | ~ ssItem(X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWC380-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.16  % 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.16/0.39  % Computer : n004.cluster.edu
% 0.16/0.39  % Model    : x86_64 x86_64
% 0.16/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39  % Memory   : 8042.1875MB
% 0.16/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit   : 300
% 0.16/0.39  % WCLimit    : 300
% 0.16/0.39  % DateTime   : Sun May 19 02:44:38 EDT 2024
% 0.16/0.39  % CPUTime    : 
% 0.16/0.39  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.16/0.40  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.71/0.90  % (24841)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.71/0.90  % (24839)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.71/0.90  % (24840)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.71/0.90  % (24842)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.71/0.90  % (24843)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.71/0.90  % (24844)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.71/0.90  % (24845)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.71/0.90  % (24846)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.71/0.90  % (24846)Refutation not found, incomplete strategy% (24846)------------------------------
% 0.71/0.90  % (24846)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90  % (24846)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90  
% 0.71/0.90  % (24846)Memory used [KB]: 1186
% 0.71/0.90  % (24846)Time elapsed: 0.004 s
% 0.71/0.90  % (24846)Instructions burned: 4 (million)
% 0.71/0.90  % (24846)------------------------------
% 0.71/0.90  % (24846)------------------------------
% 0.71/0.90  % (24844)First to succeed.
% 0.71/0.90  % (24841)Also succeeded, but the first one will report.
% 0.71/0.90  % (24844)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-24838"
% 0.71/0.90  % (24843)Refutation not found, incomplete strategy% (24843)------------------------------
% 0.71/0.90  % (24843)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90  % (24844)Refutation found. Thanks to Tanya!
% 0.71/0.90  % SZS status Unsatisfiable for theBenchmark
% 0.71/0.90  % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.90  % (24844)------------------------------
% 0.71/0.90  % (24844)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90  % (24844)Termination reason: Refutation
% 0.71/0.90  
% 0.71/0.90  % (24844)Memory used [KB]: 1215
% 0.71/0.90  % (24844)Time elapsed: 0.006 s
% 0.71/0.90  % (24844)Instructions burned: 9 (million)
% 0.71/0.90  % (24838)Success in time 0.497 s
% 0.75/0.90  % Vampire---4.8 exiting
%------------------------------------------------------------------------------