↑ Up

Z3---4.15.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN951+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n007.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 : Sat Jun 21 05:41:03 AM UTC 2025

% Result   : Theorem 0.12s 0.35s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   19 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :  100 (   0 equ)
%            Maximal formula atoms :    9 (   5 avg)
%            Number of connectives :   98 (  17   ~;  12   |;  22   &)
%                                         (  17 <=>;  30  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-1 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   20 (   0   !;  20   ?;  20   :)

% Comments : 
%------------------------------------------------------------------------------
tff(q_type,type,
    q: $o ).

tff(b_type,type,
    b: $o ).

tff(a_type,type,
    a: $o ).

tff(p_type,type,
    p: $i > $o ).

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

tff(2,plain,
    ( ( ? [X: $i] : p(X)
     => ? [X: $i] : p(X) )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(3,plain,
    ( ( ? [X: $i] : p(X)
      & $true )
  <=> ? [X: $i] : p(X) ),
    inference(rewrite,[status(thm)],[]) ).

tff(4,plain,
    ( ( a
     => $true )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(5,plain,
    ( ( $true
      & $true )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(6,plain,
    ( ( q
     => q )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(7,plain,
    ( ( b
      | ~ b )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(8,plain,
    ( ( ( b
        | ~ b )
      & ( q
       => q ) )
  <=> ( $true
      & $true ) ),
    inference(monotonicity,[status(thm)],[7,6]) ).

tff(9,plain,
    ( ( ( b
        | ~ b )
      & ( q
       => q ) )
  <=> $true ),
    inference(transitivity,[status(thm)],[8,5]) ).

tff(10,plain,
    ( ( a
     => ( ( b
          | ~ b )
        & ( q
         => q ) ) )
  <=> ( a
     => $true ) ),
    inference(monotonicity,[status(thm)],[9]) ).

tff(11,plain,
    ( ( a
     => ( ( b
          | ~ b )
        & ( q
         => q ) ) )
  <=> $true ),
    inference(transitivity,[status(thm)],[10,4]) ).

tff(12,plain,
    ( ( ? [X: $i] : p(X)
      & ( a
       => ( ( b
            | ~ b )
          & ( q
           => q ) ) ) )
  <=> ( ? [X: $i] : p(X)
      & $true ) ),
    inference(monotonicity,[status(thm)],[11]) ).

tff(13,plain,
    ( ( ? [X: $i] : p(X)
      & ( a
       => ( ( b
            | ~ b )
          & ( q
           => q ) ) ) )
  <=> ? [X: $i] : p(X) ),
    inference(transitivity,[status(thm)],[12,3]) ).

tff(14,plain,
    ( ( ? [X: $i] : p(X)
     => ( ? [X: $i] : p(X)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) )
  <=> ( ? [X: $i] : p(X)
     => ? [X: $i] : p(X) ) ),
    inference(monotonicity,[status(thm)],[13]) ).

tff(15,plain,
    ( ( ? [X: $i] : p(X)
     => ( ? [X: $i] : p(X)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) )
  <=> $true ),
    inference(transitivity,[status(thm)],[14,2]) ).

tff(16,plain,
    ( ~ ( ? [X: $i] : p(X)
       => ( ? [X: $i] : p(X)
          & ( a
           => ( ( b
                | ~ b )
              & ( q
               => q ) ) ) ) )
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[15]) ).

tff(17,plain,
    ( ~ ( ? [X: $i] : p(X)
       => ( ? [X: $i] : p(X)
          & ( a
           => ( ( b
                | ~ b )
              & ( q
               => q ) ) ) ) )
  <=> $false ),
    inference(transitivity,[status(thm)],[16,1]) ).

tff(18,axiom,
    ~ ( ? [X: $i] : p(X)
     => ( ? [X: $i] : p(X)
        & ( a
         => ( ( b
              | ~ b )
            & ( q
             => q ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

tff(19,plain,
    $false,
    inference(modus_ponens,[status(thm)],[18,17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SYN951+1 : TPTP v9.0.0. Released v3.1.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n007.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Fri Jun 20 13:03:05 EDT 2025
% 0.12/0.32  % CPUTime    : 
% 0.12/0.35  % SZS status Theorem
% 0.12/0.35  % SZS output start Proof
% See solution above
% 0.12/0.35  % E exiting
%------------------------------------------------------------------------------