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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC083-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 : n023.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:06 EDT 2024

% Result   : Unsatisfiable 0.63s 0.83s
% Output   : Refutation 0.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   72 (  20 unt;   0 def)
%            Number of atoms       :  181 (  18 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  225 ( 116   ~; 108   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   31 (  31   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f732,plain,
    $false,
    inference(avatar_sat_refutation,[],[f325,f731]) ).

fof(f731,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f730]) ).

fof(f730,plain,
    ( $false
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f729,f216]) ).

fof(f216,plain,
    ~ segmentP(sk3,sk4),
    inference(subsumption_resolution,[],[f215,f201]) ).

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

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

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

fof(f215,plain,
    ( ~ segmentP(sk3,sk4)
    | ~ neq(sk4,nil) ),
    inference(subsumption_resolution,[],[f214,f200]) ).

fof(f200,plain,
    ssList(sk4),
    inference(definition_unfolding,[],[f187,f190]) ).

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

fof(f214,plain,
    ( ~ ssList(sk4)
    | ~ segmentP(sk3,sk4)
    | ~ neq(sk4,nil) ),
    inference(duplicate_literal_removal,[],[f213]) ).

fof(f213,plain,
    ( ~ ssList(sk4)
    | ~ segmentP(sk3,sk4)
    | ~ neq(sk4,nil)
    | ~ ssList(sk4) ),
    inference(resolution,[],[f57,f202]) ).

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

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

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

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

fof(f729,plain,
    ( segmentP(sk3,sk4)
    | ~ spl0_4 ),
    inference(forward_demodulation,[],[f727,f556]) ).

fof(f556,plain,
    ( sk3 = app(sk4,sk6)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f549,f518]) ).

fof(f518,plain,
    ( ssList(app(sk4,sk6))
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f256,f516]) ).

fof(f516,plain,
    ( sk4 = sk5
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f510,f194]) ).

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

fof(f510,plain,
    ( sk4 = sk5
    | ~ ssList(sk5)
    | ~ spl0_4 ),
    inference(superposition,[],[f491,f73]) ).

fof(f73,axiom,
    ! [X0] :
      ( app(X0,nil) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause73) ).

fof(f491,plain,
    ( sk4 = app(sk5,nil)
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f198,f488]) ).

fof(f488,plain,
    ( nil = sk7
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f487,f8]) ).

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

fof(f487,plain,
    ( nil = sk7
    | ~ ssList(nil)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f486,f196]) ).

fof(f196,axiom,
    ssList(sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f486,plain,
    ( nil = sk7
    | ~ ssList(sk7)
    | ~ ssList(nil)
    | ~ spl0_4 ),
    inference(resolution,[],[f406,f100]) ).

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

fof(f406,plain,
    ( ~ neq(sk7,nil)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f405,f196]) ).

fof(f405,plain,
    ( ~ neq(sk7,nil)
    | ~ ssList(sk7)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f401,f400]) ).

fof(f400,plain,
    ( segmentP(sk3,sk7)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f399,f8]) ).

fof(f399,plain,
    ( segmentP(sk3,sk7)
    | ~ ssList(nil)
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f396,f199]) ).

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

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

fof(f396,plain,
    ( ~ ssList(sk3)
    | segmentP(sk3,sk7)
    | ~ ssList(nil)
    | ~ spl0_4 ),
    inference(duplicate_literal_removal,[],[f395]) ).

fof(f395,plain,
    ( ~ ssList(sk3)
    | segmentP(sk3,sk7)
    | ~ ssList(nil)
    | ~ ssList(sk3)
    | ~ spl0_4 ),
    inference(superposition,[],[f360,f73]) ).

fof(f360,plain,
    ( ! [X0] :
        ( ~ ssList(app(sk3,X0))
        | segmentP(app(sk3,X0),sk7)
        | ~ ssList(X0) )
    | ~ spl0_4 ),
    inference(subsumption_resolution,[],[f359,f256]) ).

fof(f359,plain,
    ! [X0] :
      ( ~ ssList(app(sk3,X0))
      | segmentP(app(sk3,X0),sk7)
      | ~ ssList(app(sk5,sk6))
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f346,f196]) ).

fof(f346,plain,
    ! [X0] :
      ( ~ ssList(app(sk3,X0))
      | segmentP(app(sk3,X0),sk7)
      | ~ ssList(sk7)
      | ~ ssList(app(sk5,sk6))
      | ~ ssList(X0) ),
    inference(superposition,[],[f204,f197]) ).

fof(f197,axiom,
    sk3 = app(app(sk5,sk6),sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f204,plain,
    ! [X2,X0,X1] :
      ( ~ ssList(app(app(X0,X1),X2))
      | segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f173]) ).

fof(f173,axiom,
    ! [X2,X3,X0,X1] :
      ( segmentP(X3,X1)
      | ~ ssList(X3)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | app(app(X0,X1),X2) != X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause173) ).

fof(f401,plain,
    ( ~ segmentP(sk3,sk7)
    | ~ neq(sk7,nil)
    | ~ ssList(sk7) ),
    inference(resolution,[],[f393,f202]) ).

fof(f393,plain,
    segmentP(sk4,sk7),
    inference(subsumption_resolution,[],[f392,f8]) ).

fof(f392,plain,
    ( segmentP(sk4,sk7)
    | ~ ssList(nil) ),
    inference(subsumption_resolution,[],[f389,f200]) ).

fof(f389,plain,
    ( ~ ssList(sk4)
    | segmentP(sk4,sk7)
    | ~ ssList(nil) ),
    inference(duplicate_literal_removal,[],[f388]) ).

fof(f388,plain,
    ( ~ ssList(sk4)
    | segmentP(sk4,sk7)
    | ~ ssList(nil)
    | ~ ssList(sk4) ),
    inference(superposition,[],[f358,f73]) ).

fof(f358,plain,
    ! [X0] :
      ( ~ ssList(app(sk4,X0))
      | segmentP(app(sk4,X0),sk7)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f357,f194]) ).

fof(f357,plain,
    ! [X0] :
      ( ~ ssList(app(sk4,X0))
      | segmentP(app(sk4,X0),sk7)
      | ~ ssList(sk5)
      | ~ ssList(X0) ),
    inference(subsumption_resolution,[],[f345,f196]) ).

fof(f345,plain,
    ! [X0] :
      ( ~ ssList(app(sk4,X0))
      | segmentP(app(sk4,X0),sk7)
      | ~ ssList(sk7)
      | ~ ssList(sk5)
      | ~ ssList(X0) ),
    inference(superposition,[],[f204,f198]) ).

fof(f198,axiom,
    sk4 = app(sk5,sk7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

fof(f256,plain,
    ( ssList(app(sk5,sk6))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f255]) ).

fof(f255,plain,
    ( spl0_4
  <=> ssList(app(sk5,sk6)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).

fof(f549,plain,
    ( sk3 = app(sk4,sk6)
    | ~ ssList(app(sk4,sk6))
    | ~ spl0_4 ),
    inference(superposition,[],[f533,f73]) ).

fof(f533,plain,
    ( sk3 = app(app(sk4,sk6),nil)
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f490,f516]) ).

fof(f490,plain,
    ( sk3 = app(app(sk5,sk6),nil)
    | ~ spl0_4 ),
    inference(backward_demodulation,[],[f197,f488]) ).

fof(f727,plain,
    segmentP(app(sk4,sk6),sk4),
    inference(resolution,[],[f646,f195]) ).

fof(f195,axiom,
    ssList(sk6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

fof(f646,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | segmentP(app(sk4,X0),sk4) ),
    inference(resolution,[],[f362,f200]) ).

fof(f362,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X1) ),
    inference(subsumption_resolution,[],[f361,f85]) ).

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).

fof(f361,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(subsumption_resolution,[],[f353,f8]) ).

fof(f353,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f349]) ).

fof(f349,plain,
    ! [X0,X1] :
      ( ~ ssList(app(X0,X1))
      | segmentP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(nil)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(superposition,[],[f204,f74]) ).

fof(f74,axiom,
    ! [X0] :
      ( app(nil,X0) = X0
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause74) ).

fof(f325,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f324]) ).

fof(f324,plain,
    ( $false
    | spl0_4 ),
    inference(subsumption_resolution,[],[f323,f195]) ).

fof(f323,plain,
    ( ~ ssList(sk6)
    | spl0_4 ),
    inference(subsumption_resolution,[],[f322,f194]) ).

fof(f322,plain,
    ( ~ ssList(sk5)
    | ~ ssList(sk6)
    | spl0_4 ),
    inference(resolution,[],[f257,f85]) ).

fof(f257,plain,
    ( ~ ssList(app(sk5,sk6))
    | spl0_4 ),
    inference(avatar_component_clause,[],[f255]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWC083-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/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.15/0.35  % Computer : n023.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Sun May 19 02:37:38 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.15/0.36  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.63/0.81  % (12952)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.63/0.81  % (12945)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.63/0.81  % (12947)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.63/0.81  % (12948)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.63/0.81  % (12949)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.63/0.81  % (12951)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.63/0.81  % (12950)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.63/0.81  % (12946)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.63/0.82  % (12952)Instruction limit reached!
% 0.63/0.82  % (12952)------------------------------
% 0.63/0.82  % (12952)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (12952)Termination reason: Unknown
% 0.63/0.82  % (12952)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (12952)Memory used [KB]: 1597
% 0.63/0.82  % (12952)Time elapsed: 0.017 s
% 0.63/0.82  % (12952)Instructions burned: 57 (million)
% 0.63/0.82  % (12952)------------------------------
% 0.63/0.82  % (12952)------------------------------
% 0.63/0.82  % (12948)Instruction limit reached!
% 0.63/0.82  % (12948)------------------------------
% 0.63/0.82  % (12948)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (12949)Instruction limit reached!
% 0.63/0.82  % (12949)------------------------------
% 0.63/0.82  % (12949)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.82  % (12948)Termination reason: Unknown
% 0.63/0.82  % (12948)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (12948)Memory used [KB]: 1759
% 0.63/0.82  % (12948)Time elapsed: 0.018 s
% 0.63/0.82  % (12948)Instructions burned: 34 (million)
% 0.63/0.82  % (12948)------------------------------
% 0.63/0.82  % (12948)------------------------------
% 0.63/0.82  % (12949)Termination reason: Unknown
% 0.63/0.82  % (12949)Termination phase: Saturation
% 0.63/0.82  
% 0.63/0.82  % (12949)Memory used [KB]: 1547
% 0.63/0.82  % (12949)Time elapsed: 0.018 s
% 0.63/0.82  % (12949)Instructions burned: 36 (million)
% 0.63/0.82  % (12949)------------------------------
% 0.63/0.82  % (12949)------------------------------
% 0.63/0.82  % (12947)First to succeed.
% 0.63/0.82  % (12960)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.63/0.83  % (12947)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-12937"
% 0.63/0.83  % (12947)Refutation found. Thanks to Tanya!
% 0.63/0.83  % SZS status Unsatisfiable for theBenchmark
% 0.63/0.83  % SZS output start Proof for theBenchmark
% See solution above
% 0.63/0.83  % (12947)------------------------------
% 0.63/0.83  % (12947)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.83  % (12947)Termination reason: Refutation
% 0.63/0.83  
% 0.63/0.83  % (12947)Memory used [KB]: 1349
% 0.63/0.83  % (12947)Time elapsed: 0.019 s
% 0.63/0.83  % (12947)Instructions burned: 28 (million)
% 0.63/0.83  % (12937)Success in time 0.472 s
% 0.63/0.83  % Vampire---4.8 exiting
%------------------------------------------------------------------------------