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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : SWC044-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n027.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:54:52 EDT 2022

% Result   : Unsatisfiable 0.20s 0.45s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   39 (  12 unt;   6 typ;   0 def)
%            Number of atoms       :  175 (  55 equ)
%            Maximal formula atoms :   12 (   5 avg)
%            Number of connectives :  238 ( 113   ~; 102   |;   0   &)
%                                         (  23 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   17 (  17 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   25 (  22   !;   0   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
tff(sk3_type,type,
    sk3: $i ).

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

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

tff(nil_type,type,
    nil: $i ).

tff(rearsegP_type,type,
    rearsegP: ( $i * $i ) > $o ).

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

tff(1,plain,
    ( ( nil != sk1 )
  <=> ( sk4 != sk3 ) ),
    inference(rewrite,[status(thm)],]) ).

tff(2,plain,
    ( ( nil != sk1 )
  <=> ( nil != sk1 ) ),
    inference(rewrite,[status(thm)],]) ).

tff(3,axiom,
    nil != sk1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

tff(4,plain,
    nil != sk1,
    inference(modus_ponens,[status(thm)],[3,2]) ).

tff(5,plain,
    sk4 != sk3,
    inference(modus_ponens,[status(thm)],[4,1]) ).

tff(6,plain,
    ( rearsegP(sk4,sk3)
  <=> rearsegP(sk4,sk3) ),
    inference(rewrite,[status(thm)],]) ).

tff(7,axiom,
    rearsegP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

tff(8,plain,
    rearsegP(sk4,sk3),
    inference(modus_ponens,[status(thm)],[7,6]) ).

tff(9,plain,
    ( ssList(sk1)
  <=> ssList(sk3) ),
    inference(rewrite,[status(thm)],]) ).

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

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

tff(12,plain,
    ssList(sk1),
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    ssList(sk3),
    inference(modus_ponens,[status(thm)],[12,9]) ).

tff(14,plain,
    ^ [U: $i] :
      refl(
        ( ( ~ ssList(U)
          | ( sk4 = U )
          | ~ rearsegP(sk4,U) )
      <=> ( ~ ssList(U)
          | ( sk4 = U )
          | ~ rearsegP(sk4,U) ) )),
    inference(bind,[status(th)],]) ).

tff(15,plain,
    ( ! [U: $i] :
        ( ~ ssList(U)
        | ( sk4 = U )
        | ~ rearsegP(sk4,U) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | ( sk4 = U )
        | ~ rearsegP(sk4,U) ) ),
    inference(quant_intro,[status(thm)],[14]) ).

tff(16,plain,
    ^ [U: $i] :
      trans(
        monotonicity(
          rewrite(
            ( ( nil = U )
          <=> ( sk4 = U ) )),
          rewrite(
            ( ~ rearsegP(nil,U)
          <=> ~ rearsegP(sk4,U) )),
          ( ( ~ ssList(U)
            | ( nil = U )
            | ~ rearsegP(nil,U) )
        <=> ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) ) )),
        rewrite(
          ( ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
        <=> ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) ) )),
        ( ( ~ ssList(U)
          | ( nil = U )
          | ~ rearsegP(nil,U) )
      <=> ( ~ ssList(U)
          | ( sk4 = U )
          | ~ rearsegP(sk4,U) ) )),
    inference(bind,[status(th)],]) ).

tff(17,plain,
    ( ! [U: $i] :
        ( ~ ssList(U)
        | ( nil = U )
        | ~ rearsegP(nil,U) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | ( sk4 = U )
        | ~ rearsegP(sk4,U) ) ),
    inference(quant_intro,[status(thm)],[16]) ).

tff(18,plain,
    ( ! [U: $i] :
        ( ~ ssList(U)
        | ( nil = U )
        | ~ rearsegP(nil,U) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | ( nil = U )
        | ~ rearsegP(nil,U) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(19,plain,
    ^ [U: $i] :
      trans(
        monotonicity(
          rewrite(
            ( ( ~ rearsegP(nil,U)
              | ~ ssList(U) )
          <=> ( ~ ssList(U)
              | ~ rearsegP(nil,U) ) )),
          ( ( ~ rearsegP(nil,U)
            | ~ ssList(U)
            | ( nil = U ) )
        <=> ( ~ ssList(U)
            | ~ rearsegP(nil,U)
            | ( nil = U ) ) )),
        rewrite(
          ( ( ~ ssList(U)
            | ~ rearsegP(nil,U)
            | ( nil = U ) )
        <=> ( ~ ssList(U)
            | ( nil = U )
            | ~ rearsegP(nil,U) ) )),
        ( ( ~ rearsegP(nil,U)
          | ~ ssList(U)
          | ( nil = U ) )
      <=> ( ~ ssList(U)
          | ( nil = U )
          | ~ rearsegP(nil,U) ) )),
    inference(bind,[status(th)],]) ).

tff(20,plain,
    ( ! [U: $i] :
        ( ~ rearsegP(nil,U)
        | ~ ssList(U)
        | ( nil = U ) )
  <=> ! [U: $i] :
        ( ~ ssList(U)
        | ( nil = U )
        | ~ rearsegP(nil,U) ) ),
    inference(quant_intro,[status(thm)],[19]) ).

tff(21,axiom,
    ! [U: $i] :
      ( ~ rearsegP(nil,U)
      | ~ ssList(U)
      | ( nil = U ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).

tff(22,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | ( nil = U )
      | ~ rearsegP(nil,U) ),
    inference(modus_ponens,[status(thm)],[21,20]) ).

tff(23,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | ( nil = U )
      | ~ rearsegP(nil,U) ),
    inference(modus_ponens,[status(thm)],[22,18]) ).

tff(24,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | ( sk4 = U )
      | ~ rearsegP(sk4,U) ),
    inference(modus_ponens,[status(thm)],[23,17]) ).

tff(25,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | ( sk4 = U )
      | ~ rearsegP(sk4,U) ),
    inference(skolemize,[status(sab)],[24]) ).

tff(26,plain,
    ! [U: $i] :
      ( ~ ssList(U)
      | ( sk4 = U )
      | ~ rearsegP(sk4,U) ),
    inference(modus_ponens,[status(thm)],[25,15]) ).

tff(27,plain,
    ( ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ( sk4 = sk3 )
      | ~ ssList(sk3)
      | ~ rearsegP(sk4,sk3) )
  <=> ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ( sk4 = sk3 )
      | ~ ssList(sk3)
      | ~ rearsegP(sk4,sk3) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(28,plain,
    ( ( ~ ssList(sk3)
      | ( sk4 = sk3 )
      | ~ rearsegP(sk4,sk3) )
  <=> ( ( sk4 = sk3 )
      | ~ ssList(sk3)
      | ~ rearsegP(sk4,sk3) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(29,plain,
    ( ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ~ ssList(sk3)
      | ( sk4 = sk3 )
      | ~ rearsegP(sk4,sk3) )
  <=> ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ( sk4 = sk3 )
      | ~ ssList(sk3)
      | ~ rearsegP(sk4,sk3) ) ),
    inference(monotonicity,[status(thm)],[28]) ).

tff(30,plain,
    ( ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ~ ssList(sk3)
      | ( sk4 = sk3 )
      | ~ rearsegP(sk4,sk3) )
  <=> ( ~ ! [U: $i] :
            ( ~ ssList(U)
            | ( sk4 = U )
            | ~ rearsegP(sk4,U) )
      | ( sk4 = sk3 )
      | ~ ssList(sk3)
      | ~ rearsegP(sk4,sk3) ) ),
    inference(transitivity,[status(thm)],[29,27]) ).

tff(31,plain,
    ( ~ ! [U: $i] :
          ( ~ ssList(U)
          | ( sk4 = U )
          | ~ rearsegP(sk4,U) )
    | ~ ssList(sk3)
    | ( sk4 = sk3 )
    | ~ rearsegP(sk4,sk3) ),
    inference(quant_inst,[status(thm)],]) ).

tff(32,plain,
    ( ~ ! [U: $i] :
          ( ~ ssList(U)
          | ( sk4 = U )
          | ~ rearsegP(sk4,U) )
    | ( sk4 = sk3 )
    | ~ ssList(sk3)
    | ~ rearsegP(sk4,sk3) ),
    inference(modus_ponens,[status(thm)],[31,30]) ).

tff(33,plain,
    $false,
    inference(unit_resolution,[status(thm)],[32,26,13,8,5]) ).

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