↑ Up

Z3---4.15.1.THM-Prf.s

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

% Computer : n009.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:06 AM UTC 2025

% Result   : Theorem 0.19s 0.35s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    6 (   1 unt;   0 typ;   0 def)
%            Number of atoms       :   14 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   13 (   5   ~;   0   |;   0   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 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  :    3 (   1 usr;   2 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

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

tff(z_type,type,
    z: $i ).

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

tff(2,plain,
    ( ( p(z)
     => p(z) )
  <=> $true ),
    inference(rewrite,[status(thm)],[]) ).

tff(3,plain,
    ( ~ ( p(z)
       => p(z) )
  <=> ~ $true ),
    inference(monotonicity,[status(thm)],[2]) ).

tff(4,plain,
    ( ~ ( p(z)
       => p(z) )
  <=> $false ),
    inference(transitivity,[status(thm)],[3,1]) ).

tff(5,axiom,
    ~ ( p(z)
     => p(z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(6,plain,
    $false,
    inference(modus_ponens,[status(thm)],[5,4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SYN973+1 : TPTP v9.0.0. Released v3.1.0.
% 0.04/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n009.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.33  % DateTime   : Fri Jun 20 13:02:03 EDT 2025
% 0.12/0.33  % CPUTime    : 
% 0.19/0.35  % SZS status Theorem
% 0.19/0.35  % SZS output start Proof
% See solution above
% 0.19/0.35  % E exiting
%------------------------------------------------------------------------------