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

View Problem - Process Solution

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

% Computer : n017.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 : Thu Sep 29 23:54:02 EDT 2022

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   33
% Syntax   : Number of formulae    :   68 (  16 unt;   6 typ;   0 def)
%            Number of atoms       :  190 (   0 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :  231 ( 108   ~;  94   |;   0   &)
%                                         (  29 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    5 (   5 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   13 (   5   >;   8   *;   0   +;   0  <<)
%            Number of predicates  :    9 (   7 usr;   2 prp; 0-3 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :  114 ( 104   !;   0   ?; 114   :)

% Comments : 
%------------------------------------------------------------------------------
tff(p4_type,type,
    p4: ( $i * $i * $i ) > $o ).

tff(c_type,type,
    c: $i ).

tff(k3_type,type,
    k3: ( $i * $i * $i ) > $o ).

tff(p2_type,type,
    p2: ( $i * $i * $i ) > $o ).

tff(m1_type,type,
    m1: ( $i * $i * $i ) > $o ).

tff(l0_type,type,
    l0: $i > $o ).

tff(1,plain,
    ^ [B: $i,C: $i] :
      refl(
        ( ( p4(B,C,B)
          | ~ k3(B,B,C) )
      <=> ( p4(B,C,B)
          | ~ k3(B,B,C) ) )),
    inference(bind,[status(th)],]) ).

tff(2,plain,
    ( ! [B: $i,C: $i] :
        ( p4(B,C,B)
        | ~ k3(B,B,C) )
  <=> ! [B: $i,C: $i] :
        ( p4(B,C,B)
        | ~ k3(B,B,C) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [B: $i,C: $i] :
        ( p4(B,C,B)
        | ~ k3(B,B,C) )
  <=> ! [B: $i,C: $i] :
        ( p4(B,C,B)
        | ~ k3(B,B,C) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(4,axiom,
    ! [B: $i,C: $i] :
      ( p4(B,C,B)
      | ~ k3(B,B,C) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_287) ).

tff(5,plain,
    ! [B: $i,C: $i] :
      ( p4(B,C,B)
      | ~ k3(B,B,C) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [B: $i,C: $i] :
      ( p4(B,C,B)
      | ~ k3(B,B,C) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [B: $i,C: $i] :
      ( p4(B,C,B)
      | ~ k3(B,B,C) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ^ [D: $i,E: $i] :
      refl(
        ( ( p2(D,E,D)
          | ~ m1(E,D,E) )
      <=> ( p2(D,E,D)
          | ~ m1(E,D,E) ) )),
    inference(bind,[status(th)],]) ).

tff(9,plain,
    ( ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) )
  <=> ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) ) ),
    inference(quant_intro,[status(thm)],[8]) ).

tff(10,plain,
    ( ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) )
  <=> ! [D: $i,E: $i] :
        ( p2(D,E,D)
        | ~ m1(E,D,E) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(11,axiom,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_176) ).

tff(12,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(skolemize,[status(sab)],[12]) ).

tff(14,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[13,9]) ).

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

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

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

tff(18,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).

tff(19,plain,
    ( l0(c)
  <=> $true ),
    inference(iff_true,[status(thm)],[18]) ).

tff(20,plain,
    ( ~ l0(c)
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[19]) ).

tff(21,plain,
    ( ~ l0(c)
  <=> $false ),
    inference(transitivity,[status(thm)],[20,17]) ).

tff(22,plain,
    ( ( ~ l0(c)
      | m1(c,c,c) )
  <=> ( $false
      | m1(c,c,c) ) ),
    inference(monotonicity,[status(thm)],[21]) ).

tff(23,plain,
    ( ( ~ l0(c)
      | m1(c,c,c) )
  <=> m1(c,c,c) ),
    inference(transitivity,[status(thm)],[22,16]) ).

tff(24,plain,
    ( ( m1(c,c,c)
      | ~ l0(c) )
  <=> ( ~ l0(c)
      | m1(c,c,c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(25,axiom,
    ( m1(c,c,c)
    | ~ l0(c) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_020) ).

tff(26,plain,
    ( ~ l0(c)
    | m1(c,c,c) ),
    inference(modus_ponens,[status(thm)],[25,24]) ).

tff(27,plain,
    m1(c,c,c),
    inference(modus_ponens,[status(thm)],[26,23]) ).

tff(28,plain,
    m1(c,c,c),
    inference(modus_ponens,[status(thm)],[27,15]) ).

tff(29,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(c,c,c)
      | p2(c,c,c) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(c,c,c)
      | p2(c,c,c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(30,plain,
    ( ( p2(c,c,c)
      | ~ m1(c,c,c) )
  <=> ( ~ m1(c,c,c)
      | p2(c,c,c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(31,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | p2(c,c,c)
      | ~ m1(c,c,c) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(c,c,c)
      | p2(c,c,c) ) ),
    inference(monotonicity,[status(thm)],[30]) ).

tff(32,plain,
    ( ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | p2(c,c,c)
      | ~ m1(c,c,c) )
  <=> ( ~ ! [D: $i,E: $i] :
            ( p2(D,E,D)
            | ~ m1(E,D,E) )
      | ~ m1(c,c,c)
      | p2(c,c,c) ) ),
    inference(transitivity,[status(thm)],[31,29]) ).

tff(33,plain,
    ( ~ ! [D: $i,E: $i] :
          ( p2(D,E,D)
          | ~ m1(E,D,E) )
    | p2(c,c,c)
    | ~ m1(c,c,c) ),
    inference(quant_inst,[status(thm)],]) ).

tff(34,plain,
    ( ~ ! [D: $i,E: $i] :
          ( p2(D,E,D)
          | ~ m1(E,D,E) )
    | ~ m1(c,c,c)
    | p2(c,c,c) ),
    inference(modus_ponens,[status(thm)],[33,32]) ).

tff(35,plain,
    p2(c,c,c),
    inference(unit_resolution,[status(thm)],[34,28,14]) ).

tff(36,plain,
    ^ [D: $i,C: $i] :
      refl(
        ( ( ~ p2(D,C,C)
          | k3(C,D,C) )
      <=> ( ~ p2(D,C,C)
          | k3(C,D,C) ) )),
    inference(bind,[status(th)],]) ).

tff(37,plain,
    ( ! [D: $i,C: $i] :
        ( ~ p2(D,C,C)
        | k3(C,D,C) )
  <=> ! [D: $i,C: $i] :
        ( ~ p2(D,C,C)
        | k3(C,D,C) ) ),
    inference(quant_intro,[status(thm)],[36]) ).

tff(38,plain,
    ( ! [D: $i,C: $i] :
        ( ~ p2(D,C,C)
        | k3(C,D,C) )
  <=> ! [D: $i,C: $i] :
        ( ~ p2(D,C,C)
        | k3(C,D,C) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(39,plain,
    ^ [D: $i,C: $i] :
      rewrite(
        ( ( k3(C,D,C)
          | ~ p2(D,C,C) )
      <=> ( ~ p2(D,C,C)
          | k3(C,D,C) ) )),
    inference(bind,[status(th)],]) ).

tff(40,plain,
    ( ! [D: $i,C: $i] :
        ( k3(C,D,C)
        | ~ p2(D,C,C) )
  <=> ! [D: $i,C: $i] :
        ( ~ p2(D,C,C)
        | k3(C,D,C) ) ),
    inference(quant_intro,[status(thm)],[39]) ).

tff(41,axiom,
    ! [D: $i,C: $i] :
      ( k3(C,D,C)
      | ~ p2(D,C,C) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_206) ).

tff(42,plain,
    ! [D: $i,C: $i] :
      ( ~ p2(D,C,C)
      | k3(C,D,C) ),
    inference(modus_ponens,[status(thm)],[41,40]) ).

tff(43,plain,
    ! [D: $i,C: $i] :
      ( ~ p2(D,C,C)
      | k3(C,D,C) ),
    inference(modus_ponens,[status(thm)],[42,38]) ).

tff(44,plain,
    ! [D: $i,C: $i] :
      ( ~ p2(D,C,C)
      | k3(C,D,C) ),
    inference(skolemize,[status(sab)],[43]) ).

tff(45,plain,
    ! [D: $i,C: $i] :
      ( ~ p2(D,C,C)
      | k3(C,D,C) ),
    inference(modus_ponens,[status(thm)],[44,37]) ).

tff(46,plain,
    ( ( ~ ! [D: $i,C: $i] :
            ( ~ p2(D,C,C)
            | k3(C,D,C) )
      | ~ p2(c,c,c)
      | k3(c,c,c) )
  <=> ( ~ ! [D: $i,C: $i] :
            ( ~ p2(D,C,C)
            | k3(C,D,C) )
      | ~ p2(c,c,c)
      | k3(c,c,c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(47,plain,
    ( ~ ! [D: $i,C: $i] :
          ( ~ p2(D,C,C)
          | k3(C,D,C) )
    | ~ p2(c,c,c)
    | k3(c,c,c) ),
    inference(quant_inst,[status(thm)],]) ).

tff(48,plain,
    ( ~ ! [D: $i,C: $i] :
          ( ~ p2(D,C,C)
          | k3(C,D,C) )
    | ~ p2(c,c,c)
    | k3(c,c,c) ),
    inference(modus_ponens,[status(thm)],[47,46]) ).

tff(49,plain,
    k3(c,c,c),
    inference(unit_resolution,[status(thm)],[48,45,35]) ).

tff(50,plain,
    ( ( ~ ! [B: $i,C: $i] :
            ( p4(B,C,B)
            | ~ k3(B,B,C) )
      | p4(c,c,c)
      | ~ k3(c,c,c) )
  <=> ( ~ ! [B: $i,C: $i] :
            ( p4(B,C,B)
            | ~ k3(B,B,C) )
      | p4(c,c,c)
      | ~ k3(c,c,c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(51,plain,
    ( ~ ! [B: $i,C: $i] :
          ( p4(B,C,B)
          | ~ k3(B,B,C) )
    | p4(c,c,c)
    | ~ k3(c,c,c) ),
    inference(quant_inst,[status(thm)],]) ).

tff(52,plain,
    ( ~ ! [B: $i,C: $i] :
          ( p4(B,C,B)
          | ~ k3(B,B,C) )
    | p4(c,c,c)
    | ~ k3(c,c,c) ),
    inference(modus_ponens,[status(thm)],[51,50]) ).

tff(53,plain,
    p4(c,c,c),
    inference(unit_resolution,[status(thm)],[52,49,7]) ).

tff(54,plain,
    ^ [Y: $i,X: $i] :
      refl(
        ( ~ p4(X,c,Y)
      <=> ~ p4(X,c,Y) )),
    inference(bind,[status(th)],]) ).

tff(55,plain,
    ( ! [Y: $i,X: $i] : ~ p4(X,c,Y)
  <=> ! [Y: $i,X: $i] : ~ p4(X,c,Y) ),
    inference(quant_intro,[status(thm)],[54]) ).

tff(56,plain,
    ( ! [Y: $i,X: $i] : ~ p4(X,c,Y)
  <=> ! [Y: $i,X: $i] : ~ p4(X,c,Y) ),
    inference(rewrite,[status(thm)],]) ).

tff(57,axiom,
    ! [Y: $i,X: $i] : ~ p4(X,c,Y),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(58,plain,
    ! [Y: $i,X: $i] : ~ p4(X,c,Y),
    inference(modus_ponens,[status(thm)],[57,56]) ).

tff(59,plain,
    ! [Y: $i,X: $i] : ~ p4(X,c,Y),
    inference(skolemize,[status(sab)],[58]) ).

tff(60,plain,
    ! [Y: $i,X: $i] : ~ p4(X,c,Y),
    inference(modus_ponens,[status(thm)],[59,55]) ).

tff(61,plain,
    ( ~ ! [Y: $i,X: $i] : ~ p4(X,c,Y)
    | ~ p4(c,c,c) ),
    inference(quant_inst,[status(thm)],]) ).

tff(62,plain,
    $false,
    inference(unit_resolution,[status(thm)],[61,60,53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN170-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.35  % Computer : n017.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 : Mon Sep  5 01:25:55 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.35  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35  Usage: tptp [options] [-file:]file
% 0.14/0.35    -h, -?       prints this message.
% 0.14/0.35    -smt2        print SMT-LIB2 benchmark.
% 0.14/0.35    -m, -model   generate model.
% 0.14/0.35    -p, -proof   generate proof.
% 0.14/0.35    -c, -core    generate unsat core of named formulas.
% 0.14/0.35    -st, -statistics display statistics.
% 0.14/0.35    -t:timeout   set timeout (in second).
% 0.14/0.35    -smt2status  display status in smt2 format instead of SZS.
% 0.14/0.35    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35    -<param>:<value> configuration parameter and value.
% 0.14/0.35    -o:<output-file> file to place output in.
% 0.21/0.51  % SZS status Unsatisfiable
% 0.21/0.51  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------