TSTP Solution File: SWC408-1 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWC408-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%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 Sep 20 11:57:46 EDT 2022

% Result   : Unsatisfiable 0.19s 0.44s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   43 (  14 unt;   8 typ;   0 def)
%            Number of atoms       :  262 (   0 equ)
%            Maximal formula atoms :   19 (   7 avg)
%            Number of connectives :  410 ( 203   ~; 182   |;   0   &)
%                                         (  25 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :   20 (  20 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   4   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   63 (  57   !;   0   ?;  63   :)

% Comments : 
%------------------------------------------------------------------------------
tff(memberP_type,type,
    memberP: ( $i * $i ) > $o ).

tff(sk5_type,type,
    sk5: $i ).

tff(app_type,type,
    app: ( $i * $i ) > $i ).

tff(sk4_type,type,
    sk4: $i ).

tff(sk1_type,type,
    sk1: $i ).

tff(sk2_type,type,
    sk2: $i ).

tff(ssItem_type,type,
    ssItem: $i > $o ).

tff(ssList_type,type,
    ssList: $i > $o ).

tff(1,plain,
    ( ~ memberP(sk1,sk5)
  <=> ~ memberP(app(sk4,sk4),sk5) ),
    inference(rewrite,[status(thm)],]) ).

tff(2,plain,
    ( ~ memberP(sk1,sk5)
  <=> ~ memberP(sk1,sk5) ),
    inference(rewrite,[status(thm)],]) ).

tff(3,axiom,
    ~ memberP(sk1,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).

tff(4,plain,
    ~ memberP(sk1,sk5),
    inference(modus_ponens,[status(thm)],[3,2]) ).

tff(5,plain,
    ~ memberP(app(sk4,sk4),sk5),
    inference(modus_ponens,[status(thm)],[4,1]) ).

tff(6,plain,
    ( memberP(sk2,sk5)
  <=> memberP(sk4,sk5) ),
    inference(rewrite,[status(thm)],]) ).

tff(7,plain,
    ( memberP(sk2,sk5)
  <=> memberP(sk2,sk5) ),
    inference(rewrite,[status(thm)],]) ).

tff(8,axiom,
    memberP(sk2,sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

tff(9,plain,
    memberP(sk2,sk5),
    inference(modus_ponens,[status(thm)],[8,7]) ).

tff(10,plain,
    memberP(sk4,sk5),
    inference(modus_ponens,[status(thm)],[9,6]) ).

tff(11,plain,
    ( ssItem(sk5)
  <=> ssItem(sk5) ),
    inference(rewrite,[status(thm)],]) ).

tff(12,axiom,
    ssItem(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

tff(13,plain,
    ssItem(sk5),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ( ssList(sk2)
  <=> ssList(sk4) ),
    inference(rewrite,[status(thm)],]) ).

tff(15,plain,
    ( ssList(sk2)
  <=> ssList(sk2) ),
    inference(rewrite,[status(thm)],]) ).

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

tff(17,plain,
    ssList(sk2),
    inference(modus_ponens,[status(thm)],[16,15]) ).

tff(18,plain,
    ssList(sk4),
    inference(modus_ponens,[status(thm)],[17,14]) ).

tff(19,plain,
    ^ [W: $i,V: $i,U: $i] :
      refl(
        ( ( ~ ssList(U)
          | ~ ssItem(V)
          | ~ ssList(W)
          | ~ memberP(U,V)
          | memberP(app(U,W),V) )
      <=> ( ~ ssList(U)
          | ~ ssItem(V)
          | ~ ssList(W)
          | ~ memberP(U,V)
          | memberP(app(U,W),V) ) )),
    inference(bind,[status(th)],]) ).

tff(20,plain,
    ( ! [W: $i,V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssItem(V)
        | ~ ssList(W)
        | ~ memberP(U,V)
        | memberP(app(U,W),V) )
  <=> ! [W: $i,V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssItem(V)
        | ~ ssList(W)
        | ~ memberP(U,V)
        | memberP(app(U,W),V) ) ),
    inference(quant_intro,[status(thm)],[19]) ).

tff(21,plain,
    ( ! [W: $i,V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssItem(V)
        | ~ ssList(W)
        | ~ memberP(U,V)
        | memberP(app(U,W),V) )
  <=> ! [W: $i,V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssItem(V)
        | ~ ssList(W)
        | ~ memberP(U,V)
        | memberP(app(U,W),V) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(22,plain,
    ^ [W: $i,V: $i,U: $i] :
      trans(
        monotonicity(
          trans(
            monotonicity(
              trans(
                monotonicity(
                  rewrite(
                    ( ( ~ memberP(U,V)
                      | ~ ssList(W) )
                  <=> ( ~ ssList(W)
                      | ~ memberP(U,V) ) )),
                  ( ( ~ memberP(U,V)
                    | ~ ssList(W)
                    | ~ ssList(U) )
                <=> ( ~ ssList(W)
                    | ~ memberP(U,V)
                    | ~ ssList(U) ) )),
                rewrite(
                  ( ( ~ ssList(W)
                    | ~ memberP(U,V)
                    | ~ ssList(U) )
                <=> ( ~ ssList(U)
                    | ~ ssList(W)
                    | ~ memberP(U,V) ) )),
                ( ( ~ memberP(U,V)
                  | ~ ssList(W)
                  | ~ ssList(U) )
              <=> ( ~ ssList(U)
                  | ~ ssList(W)
                  | ~ memberP(U,V) ) )),
              ( ( ~ memberP(U,V)
                | ~ ssList(W)
                | ~ ssList(U)
                | ~ ssItem(V) )
            <=> ( ~ ssList(U)
                | ~ ssList(W)
                | ~ memberP(U,V)
                | ~ ssItem(V) ) )),
            rewrite(
              ( ( ~ ssList(U)
                | ~ ssList(W)
                | ~ memberP(U,V)
                | ~ ssItem(V) )
            <=> ( ~ ssList(U)
                | ~ ssItem(V)
                | ~ ssList(W)
                | ~ memberP(U,V) ) )),
            ( ( ~ memberP(U,V)
              | ~ ssList(W)
              | ~ ssList(U)
              | ~ ssItem(V) )
          <=> ( ~ ssList(U)
              | ~ ssItem(V)
              | ~ ssList(W)
              | ~ memberP(U,V) ) )),
          ( ( ~ memberP(U,V)
            | ~ ssList(W)
            | ~ ssList(U)
            | ~ ssItem(V)
            | memberP(app(U,W),V) )
        <=> ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) ) )),
        rewrite(
          ( ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
        <=> ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) ) )),
        ( ( ~ memberP(U,V)
          | ~ ssList(W)
          | ~ ssList(U)
          | ~ ssItem(V)
          | memberP(app(U,W),V) )
      <=> ( ~ ssList(U)
          | ~ ssItem(V)
          | ~ ssList(W)
          | ~ memberP(U,V)
          | memberP(app(U,W),V) ) )),
    inference(bind,[status(th)],]) ).

tff(23,plain,
    ( ! [W: $i,V: $i,U: $i] :
        ( ~ memberP(U,V)
        | ~ ssList(W)
        | ~ ssList(U)
        | ~ ssItem(V)
        | memberP(app(U,W),V) )
  <=> ! [W: $i,V: $i,U: $i] :
        ( ~ ssList(U)
        | ~ ssItem(V)
        | ~ ssList(W)
        | ~ memberP(U,V)
        | memberP(app(U,W),V) ) ),
    inference(quant_intro,[status(thm)],[22]) ).

tff(24,axiom,
    ! [W: $i,V: $i,U: $i] :
      ( ~ memberP(U,V)
      | ~ ssList(W)
      | ~ ssList(U)
      | ~ ssItem(V)
      | memberP(app(U,W),V) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).

tff(25,plain,
    ! [W: $i,V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssItem(V)
      | ~ ssList(W)
      | ~ memberP(U,V)
      | memberP(app(U,W),V) ),
    inference(modus_ponens,[status(thm)],[24,23]) ).

tff(26,plain,
    ! [W: $i,V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssItem(V)
      | ~ ssList(W)
      | ~ memberP(U,V)
      | memberP(app(U,W),V) ),
    inference(modus_ponens,[status(thm)],[25,21]) ).

tff(27,plain,
    ! [W: $i,V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssItem(V)
      | ~ ssList(W)
      | ~ memberP(U,V)
      | memberP(app(U,W),V) ),
    inference(skolemize,[status(sab)],[26]) ).

tff(28,plain,
    ! [W: $i,V: $i,U: $i] :
      ( ~ ssList(U)
      | ~ ssItem(V)
      | ~ ssList(W)
      | ~ memberP(U,V)
      | memberP(app(U,W),V) ),
    inference(modus_ponens,[status(thm)],[27,20]) ).

tff(29,plain,
    ( ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | memberP(app(sk4,sk4),sk5)
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ memberP(sk4,sk5) )
  <=> ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | memberP(app(sk4,sk4),sk5)
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ memberP(sk4,sk5) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(30,plain,
    ( ( ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ ssList(sk4)
      | ~ memberP(sk4,sk5)
      | memberP(app(sk4,sk4),sk5) )
  <=> ( memberP(app(sk4,sk4),sk5)
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ memberP(sk4,sk5) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(31,plain,
    ( ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ ssList(sk4)
      | ~ memberP(sk4,sk5)
      | memberP(app(sk4,sk4),sk5) )
  <=> ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | memberP(app(sk4,sk4),sk5)
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ memberP(sk4,sk5) ) ),
    inference(monotonicity,[status(thm)],[30]) ).

tff(32,plain,
    ( ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ ssList(sk4)
      | ~ memberP(sk4,sk5)
      | memberP(app(sk4,sk4),sk5) )
  <=> ( ~ ! [W: $i,V: $i,U: $i] :
            ( ~ ssList(U)
            | ~ ssItem(V)
            | ~ ssList(W)
            | ~ memberP(U,V)
            | memberP(app(U,W),V) )
      | memberP(app(sk4,sk4),sk5)
      | ~ ssList(sk4)
      | ~ ssItem(sk5)
      | ~ memberP(sk4,sk5) ) ),
    inference(transitivity,[status(thm)],[31,29]) ).

tff(33,plain,
    ( ~ ! [W: $i,V: $i,U: $i] :
          ( ~ ssList(U)
          | ~ ssItem(V)
          | ~ ssList(W)
          | ~ memberP(U,V)
          | memberP(app(U,W),V) )
    | ~ ssList(sk4)
    | ~ ssItem(sk5)
    | ~ ssList(sk4)
    | ~ memberP(sk4,sk5)
    | memberP(app(sk4,sk4),sk5) ),
    inference(quant_inst,[status(thm)],]) ).

tff(34,plain,
    ( ~ ! [W: $i,V: $i,U: $i] :
          ( ~ ssList(U)
          | ~ ssItem(V)
          | ~ ssList(W)
          | ~ memberP(U,V)
          | memberP(app(U,W),V) )
    | memberP(app(sk4,sk4),sk5)
    | ~ ssList(sk4)
    | ~ ssItem(sk5)
    | ~ memberP(sk4,sk5) ),
    inference(modus_ponens,[status(thm)],[33,32]) ).

tff(35,plain,
    $false,
    inference(unit_resolution,[status(thm)],[34,28,18,13,10,5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWC408-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33  % Computer : n026.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Sun Sep  4 01:00:09 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34  Usage: tptp [options] [-file:]file
% 0.13/0.34    -h, -?       prints this message.
% 0.13/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.13/0.34    -m, -model   generate model.
% 0.13/0.34    -p, -proof   generate proof.
% 0.13/0.34    -c, -core    generate unsat core of named formulas.
% 0.13/0.34    -st, -statistics display statistics.
% 0.13/0.34    -t:timeout   set timeout (in second).
% 0.13/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.13/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34    -<param>:<value> configuration parameter and value.
% 0.13/0.34    -o:<output-file> file to place output in.
% 0.19/0.44  % SZS status Unsatisfiable
% 0.19/0.44  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------