↑ Up

Z3---4.15.1.THM-Prf.s

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

% Computer : n003.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:31:27 AM UTC 2025

% Result   : Theorem 0.11s 0.39s
% Output   : Proof 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   34 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :  169 (  52 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  249 ( 114   ~;  80   |;  34   &)
%                                         (  15 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(pv70_type,type,
    pv70: $i ).

tff(n0_type,type,
    n0: $i ).

tff(true_type,type,
    true: $o ).

tff(leq_type,type,
    leq: ( $i * $i ) > $o ).

tff(minus_type,type,
    minus: ( $i * $i ) > $i ).

tff(n1_type,type,
    n1: $i ).

tff(n5_type,type,
    n5: $i ).

tff(pv31_type,type,
    pv31: $i ).

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

tff(2,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).

tff(3,plain,
    true,
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ( true
    | ( n0 != pv70 )
    | ~ true ),
    inference(tautology,[status(thm)],[]) ).

tff(5,plain,
    ( true
    | ( n0 != pv70 ) ),
    inference(unit_resolution,[status(thm)],[4,3]) ).

tff(6,plain,
    ( leq(pv31,minus(n5,n1))
  <=> leq(pv31,minus(n5,n1)) ),
    inference(rewrite,[status(thm)],[]) ).

tff(7,plain,
    ( ~ ( ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) )
       => ( ( ( n0 != pv70 )
           => ( leq(n0,pv31)
              & leq(pv31,minus(n5,n1)) ) )
          & ( ( n0 = pv70 )
           => true ) ) )
  <=> ~ ( ~ ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) )
        | ( ( ( n0 = pv70 )
            | ( leq(n0,pv31)
              & leq(pv31,minus(n5,n1)) ) )
          & ( true
            | ( n0 != pv70 ) ) ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(8,axiom,
    ~ ( ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1)) )
     => ( ( ( n0 != pv70 )
         => ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( ( n0 = pv70 )
         => true ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0019) ).

tff(9,plain,
    ~ ( ~ ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) )
      | ( ( ( n0 = pv70 )
          | ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( true
          | ( n0 != pv70 ) ) ) ),
    inference(modus_ponens,[status(thm)],[8,7]) ).

tff(10,plain,
    ( leq(n0,pv31)
    & leq(pv31,minus(n5,n1)) ),
    inference(or_elim,[status(thm)],[9]) ).

tff(11,plain,
    leq(pv31,minus(n5,n1)),
    inference(and_elim,[status(thm)],[10]) ).

tff(12,plain,
    leq(pv31,minus(n5,n1)),
    inference(modus_ponens,[status(thm)],[11,6]) ).

tff(13,plain,
    ( leq(n0,pv31)
  <=> leq(n0,pv31) ),
    inference(rewrite,[status(thm)],[]) ).

tff(14,plain,
    leq(n0,pv31),
    inference(and_elim,[status(thm)],[10]) ).

tff(15,plain,
    leq(n0,pv31),
    inference(modus_ponens,[status(thm)],[14,13]) ).

tff(16,plain,
    ( ~ ( ~ leq(n0,pv31)
        | ~ leq(pv31,minus(n5,n1)) )
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1)) ),
    inference(tautology,[status(thm)],[]) ).

tff(17,plain,
    ~ ( ~ leq(n0,pv31)
      | ~ leq(pv31,minus(n5,n1)) ),
    inference(unit_resolution,[status(thm)],[16,15,12]) ).

tff(18,plain,
    ( ( n0 = pv70 )
    | ~ ( ~ leq(n0,pv31)
        | ~ leq(pv31,minus(n5,n1)) )
    | ~ leq(n0,pv31)
    | ~ leq(pv31,minus(n5,n1)) ),
    inference(tautology,[status(thm)],[]) ).

tff(19,plain,
    ( ( n0 = pv70 )
    | ~ ( ~ leq(n0,pv31)
        | ~ leq(pv31,minus(n5,n1)) ) ),
    inference(unit_resolution,[status(thm)],[18,17]) ).

tff(20,plain,
    ( ~ ~ ( ~ ( ( n0 = pv70 )
              | ~ ( ~ leq(n0,pv31)
                  | ~ leq(pv31,minus(n5,n1)) ) )
          | ~ ( true
              | ( n0 != pv70 ) ) )
  <=> ( ~ ( ( n0 = pv70 )
          | ~ ( ~ leq(n0,pv31)
              | ~ leq(pv31,minus(n5,n1)) ) )
      | ~ ( true
          | ( n0 != pv70 ) ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(21,plain,
    ( ( ( ( n0 = pv70 )
        | ~ ( ~ leq(n0,pv31)
            | ~ leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) )
  <=> ~ ( ~ ( ( n0 = pv70 )
            | ~ ( ~ leq(n0,pv31)
                | ~ leq(pv31,minus(n5,n1)) ) )
        | ~ ( true
            | ( n0 != pv70 ) ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(22,plain,
    ( ( ( n0 = pv70 )
      | ~ ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) ) )
  <=> ( ( n0 = pv70 )
      | ~ ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(23,plain,
    ( ( leq(n0,pv31)
      & leq(pv31,minus(n5,n1)) )
  <=> ~ ( ~ leq(n0,pv31)
        | ~ leq(pv31,minus(n5,n1)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(24,plain,
    ( ( ( n0 = pv70 )
      | ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1)) ) )
  <=> ( ( n0 = pv70 )
      | ~ ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) ) ) ),
    inference(monotonicity,[status(thm)],[23]) ).

tff(25,plain,
    ( ( ( n0 = pv70 )
      | ( leq(n0,pv31)
        & leq(pv31,minus(n5,n1)) ) )
  <=> ( ( n0 = pv70 )
      | ~ ( ~ leq(n0,pv31)
          | ~ leq(pv31,minus(n5,n1)) ) ) ),
    inference(transitivity,[status(thm)],[24,22]) ).

tff(26,plain,
    ( ( ( ( n0 = pv70 )
        | ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) )
  <=> ( ( ( n0 = pv70 )
        | ~ ( ~ leq(n0,pv31)
            | ~ leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) ) ),
    inference(monotonicity,[status(thm)],[25]) ).

tff(27,plain,
    ( ( ( ( n0 = pv70 )
        | ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) )
  <=> ~ ( ~ ( ( n0 = pv70 )
            | ~ ( ~ leq(n0,pv31)
                | ~ leq(pv31,minus(n5,n1)) ) )
        | ~ ( true
            | ( n0 != pv70 ) ) ) ),
    inference(transitivity,[status(thm)],[26,21]) ).

tff(28,plain,
    ( ~ ( ( ( n0 = pv70 )
          | ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( true
          | ( n0 != pv70 ) ) )
  <=> ~ ~ ( ~ ( ( n0 = pv70 )
              | ~ ( ~ leq(n0,pv31)
                  | ~ leq(pv31,minus(n5,n1)) ) )
          | ~ ( true
              | ( n0 != pv70 ) ) ) ),
    inference(monotonicity,[status(thm)],[27]) ).

tff(29,plain,
    ( ~ ( ( ( n0 = pv70 )
          | ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( true
          | ( n0 != pv70 ) ) )
  <=> ( ~ ( ( n0 = pv70 )
          | ~ ( ~ leq(n0,pv31)
              | ~ leq(pv31,minus(n5,n1)) ) )
      | ~ ( true
          | ( n0 != pv70 ) ) ) ),
    inference(transitivity,[status(thm)],[28,20]) ).

tff(30,plain,
    ( ~ ( ( ( n0 = pv70 )
          | ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( true
          | ( n0 != pv70 ) ) )
  <=> ~ ( ( ( n0 = pv70 )
          | ( leq(n0,pv31)
            & leq(pv31,minus(n5,n1)) ) )
        & ( true
          | ( n0 != pv70 ) ) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(31,plain,
    ~ ( ( ( n0 = pv70 )
        | ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) ),
    inference(or_elim,[status(thm)],[9]) ).

tff(32,plain,
    ~ ( ( ( n0 = pv70 )
        | ( leq(n0,pv31)
          & leq(pv31,minus(n5,n1)) ) )
      & ( true
        | ( n0 != pv70 ) ) ),
    inference(modus_ponens,[status(thm)],[31,30]) ).

tff(33,plain,
    ( ~ ( ( n0 = pv70 )
        | ~ ( ~ leq(n0,pv31)
            | ~ leq(pv31,minus(n5,n1)) ) )
    | ~ ( true
        | ( n0 != pv70 ) ) ),
    inference(modus_ponens,[status(thm)],[32,29]) ).

tff(34,plain,
    $false,
    inference(unit_resolution,[status(thm)],[33,19,5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SWV078+1 : TPTP v9.0.0. Bugfixed v3.3.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n003.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 300
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Fri Jun 20 09:27:09 EDT 2025
% 0.11/0.32  % CPUTime    : 
% 0.11/0.39  % SZS status Theorem
% 0.11/0.39  % SZS output start Proof
% See solution above
% 0.11/0.40  % E exiting
%------------------------------------------------------------------------------