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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC076-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 : n007.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:36:03 EDT 2024

% Result   : Unsatisfiable 0.69s 0.86s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   35 (  11 unt;   0 def)
%            Number of atoms       :   90 (  20 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  111 (  56   ~;  53   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f392,plain,
    $false,
    inference(avatar_sat_refutation,[],[f220,f221,f391]) ).

fof(f391,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f390]) ).

fof(f390,plain,
    ( $false
    | spl0_2 ),
    inference(subsumption_resolution,[],[f389,f219]) ).

fof(f219,plain,
    ( nil != sk3
    | spl0_2 ),
    inference(avatar_component_clause,[],[f217]) ).

fof(f217,plain,
    ( spl0_2
  <=> nil = sk3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f389,plain,
    nil = sk3,
    inference(subsumption_resolution,[],[f386,f201]) ).

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

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

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

fof(f386,plain,
    ( ~ ssList(sk3)
    | nil = sk3 ),
    inference(duplicate_literal_removal,[],[f384]) ).

fof(f384,plain,
    ( ~ ssList(sk3)
    | nil = sk3
    | ~ ssList(sk3) ),
    inference(resolution,[],[f382,f57]) ).

fof(f57,axiom,
    ! [X0] :
      ( segmentP(X0,X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).

fof(f382,plain,
    ! [X0] :
      ( ~ segmentP(sk3,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(subsumption_resolution,[],[f381,f241]) ).

fof(f241,plain,
    ! [X0] :
      ( segmentP(sk4,X0)
      | ~ ssList(X0)
      | ~ segmentP(sk3,X0) ),
    inference(subsumption_resolution,[],[f240,f194]) ).

fof(f194,axiom,
    ssList(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f240,plain,
    ! [X0] :
      ( segmentP(sk4,X0)
      | ~ ssList(X0)
      | ~ ssList(sk6)
      | ~ segmentP(sk3,X0) ),
    inference(subsumption_resolution,[],[f239,f193]) ).

fof(f193,axiom,
    ssList(sk5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f239,plain,
    ! [X0] :
      ( segmentP(sk4,X0)
      | ~ ssList(X0)
      | ~ ssList(sk5)
      | ~ ssList(sk6)
      | ~ segmentP(sk3,X0) ),
    inference(subsumption_resolution,[],[f224,f201]) ).

fof(f224,plain,
    ! [X0] :
      ( segmentP(sk4,X0)
      | ~ ssList(sk3)
      | ~ ssList(X0)
      | ~ ssList(sk5)
      | ~ ssList(sk6)
      | ~ segmentP(sk3,X0) ),
    inference(superposition,[],[f172,f195]) ).

fof(f195,axiom,
    sk4 = app(app(sk5,sk3),sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f172,axiom,
    ! [X2,X3,X0,X1] :
      ( segmentP(app(app(X3,X0),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | ~ ssList(X2)
      | ~ segmentP(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause172) ).

fof(f381,plain,
    ! [X0] :
      ( ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(subsumption_resolution,[],[f380,f8]) ).

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

fof(f380,plain,
    ! [X0] :
      ( ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0)
      | ~ ssList(X0)
      | nil = X0
      | ~ ssList(nil) ),
    inference(duplicate_literal_removal,[],[f379]) ).

fof(f379,plain,
    ! [X0] :
      ( ~ segmentP(sk4,X0)
      | ~ segmentP(sk3,X0)
      | ~ ssList(X0)
      | nil = X0
      | ~ ssList(X0)
      | ~ ssList(nil) ),
    inference(resolution,[],[f203,f100]) ).

fof(f100,axiom,
    ! [X0,X1] :
      ( neq(X1,X0)
      | X0 = X1
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).

fof(f203,plain,
    ! [X6] :
      ( ~ neq(X6,nil)
      | ~ segmentP(sk4,X6)
      | ~ segmentP(sk3,X6)
      | ~ ssList(X6) ),
    inference(definition_unfolding,[],[f192,f191,f190]) ).

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

fof(f192,axiom,
    ! [X6] :
      ( ~ segmentP(sk1,X6)
      | ~ segmentP(sk2,X6)
      | ~ neq(X6,nil)
      | ~ ssList(X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f221,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f204,f217,f213]) ).

fof(f213,plain,
    ( spl0_1
  <=> nil = sk4 ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).

fof(f204,plain,
    ( nil != sk3
    | nil != sk4 ),
    inference(definition_unfolding,[],[f200,f191,f190]) ).

fof(f200,axiom,
    ( nil != sk1
    | nil != sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

fof(f220,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f199,f217,f213]) ).

fof(f199,axiom,
    ( nil != sk3
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SWC076-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.14  % 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.35  % Computer : n007.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:56:52 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.20/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.69/0.85  % (20326)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.69/0.85  % (20328)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.69/0.85  % (20329)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.69/0.85  % (20330)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.69/0.85  % (20331)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.69/0.85  % (20333)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.69/0.85  % (20327)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.69/0.85  % (20331)First to succeed.
% 0.69/0.85  % (20331)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20325"
% 0.69/0.86  % (20331)Refutation found. Thanks to Tanya!
% 0.69/0.86  % SZS status Unsatisfiable for theBenchmark
% 0.69/0.86  % SZS output start Proof for theBenchmark
% See solution above
% 0.69/0.86  % (20331)------------------------------
% 0.69/0.86  % (20331)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.69/0.86  % (20331)Termination reason: Refutation
% 0.69/0.86  
% 0.69/0.86  % (20331)Memory used [KB]: 1247
% 0.69/0.86  % (20331)Time elapsed: 0.007 s
% 0.69/0.86  % (20331)Instructions burned: 8 (million)
% 0.69/0.86  % (20325)Success in time 0.492 s
% 0.69/0.86  % Vampire---4.8 exiting
%------------------------------------------------------------------------------