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

View Problem - Process Solution

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

% Computer : n006.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:25 EDT 2022

% Result   : Unsatisfiable 0.21s 0.43s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   29 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   38 (  17   ~;   8   |;   0   &)
%                                         (  13 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

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

tff(sk3_type,type,
    sk3: $i ).

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

tff(neq_type,type,
    neq: ( $i * $i ) > $o ).

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

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

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

tff(1,plain,
    ( ( $false
      | $false )
  <=> $false ),
    inference(rewrite,[status(thm)],]) ).

tff(2,plain,
    ( ~ rearsegP(sk2,sk1)
  <=> ~ rearsegP(sk4,sk3) ),
    inference(rewrite,[status(thm)],]) ).

tff(3,plain,
    ( ~ rearsegP(sk2,sk1)
  <=> ~ rearsegP(sk2,sk1) ),
    inference(rewrite,[status(thm)],]) ).

tff(4,axiom,
    ~ rearsegP(sk2,sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

tff(5,plain,
    ~ rearsegP(sk2,sk1),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ~ rearsegP(sk4,sk3),
    inference(modus_ponens,[status(thm)],[5,2]) ).

tff(7,plain,
    ( rearsegP(sk4,sk3)
  <=> $false ),
    inference(iff_false,[status(thm)],[6]) ).

tff(8,plain,
    ( ~ $true
  <=> $false ),
    inference(rewrite,[status(thm)],]) ).

tff(9,plain,
    ( neq(sk2,nil)
  <=> neq(sk4,nil) ),
    inference(rewrite,[status(thm)],]) ).

tff(10,plain,
    ( neq(sk2,nil)
  <=> neq(sk2,nil) ),
    inference(rewrite,[status(thm)],]) ).

tff(11,axiom,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

tff(12,plain,
    neq(sk2,nil),
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    neq(sk4,nil),
    inference(modus_ponens,[status(thm)],[12,9]) ).

tff(14,plain,
    ( neq(sk4,nil)
  <=> $true ),
    inference(iff_true,[status(thm)],[13]) ).

tff(15,plain,
    ( ~ neq(sk4,nil)
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[14]) ).

tff(16,plain,
    ( ~ neq(sk4,nil)
  <=> $false ),
    inference(transitivity,[status(thm)],[15,8]) ).

tff(17,plain,
    ( ( ~ neq(sk4,nil)
      | rearsegP(sk4,sk3) )
  <=> ( $false
      | $false ) ),
    inference(monotonicity,[status(thm)],[16,7]) ).

tff(18,plain,
    ( ( ~ neq(sk4,nil)
      | rearsegP(sk4,sk3) )
  <=> $false ),
    inference(transitivity,[status(thm)],[17,1]) ).

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

tff(20,axiom,
    ( ~ neq(sk4,nil)
    | rearsegP(sk4,sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

tff(21,plain,
    ( ~ neq(sk4,nil)
    | rearsegP(sk4,sk3) ),
    inference(modus_ponens,[status(thm)],[20,19]) ).

tff(22,plain,
    $false,
    inference(modus_ponens,[status(thm)],[21,18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWC365-1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34  % Computer : n006.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 : Sun Sep  4 00:21:38 EDT 2022
% 0.13/0.34  % 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.21/0.43  % SZS status Unsatisfiable
% 0.21/0.43  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------