↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n012.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:38:33 AM UTC 2025

% Result   : Unsatisfiable 0.18s 0.45s
% Output   : Proof 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   28
% Syntax   : Number of formulae    :   60 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :  276 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  372 ( 174   ~; 167   |;   0   &)
%                                         (  31 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   18 (  18 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :  112 ( 101   !;   0   ?; 112   :)

% Comments : 
%------------------------------------------------------------------------------
tff(p0_type,type,
    p0: ( $i * $i ) > $o ).

tff(e_type,type,
    e: $i ).

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

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

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

tff(l3_type,type,
    l3: ( $i * $i ) > $o ).

tff(r0_type,type,
    r0: $i > $o ).

tff(s0_type,type,
    s0: $i > $o ).

tff(1,plain,
    ( ~ l3(e,b)
  <=> ~ l3(e,b) ),
    inference(rewrite,[status(thm)],[]) ).

tff(2,axiom,
    ~ l3(e,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(3,plain,
    ~ l3(e,b),
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,plain,
    ^ [H: $i,G: $i] :
      refl(( ( ~ r0(G)
          | ~ p2(G,H,G)
          | l3(G,H) )
      <=> ( ~ r0(G)
          | ~ p2(G,H,G)
          | l3(G,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(5,plain,
    ( ! [H: $i,G: $i] :
        ( ~ r0(G)
        | ~ p2(G,H,G)
        | l3(G,H) )
  <=> ! [H: $i,G: $i] :
        ( ~ r0(G)
        | ~ p2(G,H,G)
        | l3(G,H) ) ),
    inference(quant_intro,[status(thm)],[4]) ).

tff(6,plain,
    ( ! [H: $i,G: $i] :
        ( ~ r0(G)
        | ~ p2(G,H,G)
        | l3(G,H) )
  <=> ! [H: $i,G: $i] :
        ( ~ r0(G)
        | ~ p2(G,H,G)
        | l3(G,H) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(7,plain,
    ^ [H: $i,G: $i] :
      trans(monotonicity(rewrite(( ( l3(G,H)
              | ~ r0(G) )
          <=> ( ~ r0(G)
              | l3(G,H) ) )),
          ( ( l3(G,H)
            | ~ r0(G)
            | ~ p2(G,H,G) )
        <=> ( ~ r0(G)
            | l3(G,H)
            | ~ p2(G,H,G) ) )),
        rewrite(( ( ~ r0(G)
            | l3(G,H)
            | ~ p2(G,H,G) )
        <=> ( ~ r0(G)
            | ~ p2(G,H,G)
            | l3(G,H) ) )),
        ( ( l3(G,H)
          | ~ r0(G)
          | ~ p2(G,H,G) )
      <=> ( ~ r0(G)
          | ~ p2(G,H,G)
          | l3(G,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(8,plain,
    ( ! [H: $i,G: $i] :
        ( l3(G,H)
        | ~ r0(G)
        | ~ p2(G,H,G) )
  <=> ! [H: $i,G: $i] :
        ( ~ r0(G)
        | ~ p2(G,H,G)
        | l3(G,H) ) ),
    inference(quant_intro,[status(thm)],[7]) ).

tff(9,axiom,
    ! [H: $i,G: $i] :
      ( l3(G,H)
      | ~ r0(G)
      | ~ p2(G,H,G) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_215) ).

tff(10,plain,
    ! [H: $i,G: $i] :
      ( ~ r0(G)
      | ~ p2(G,H,G)
      | l3(G,H) ),
    inference(modus_ponens,[status(thm)],[9,8]) ).

tff(11,plain,
    ! [H: $i,G: $i] :
      ( ~ r0(G)
      | ~ p2(G,H,G)
      | l3(G,H) ),
    inference(modus_ponens,[status(thm)],[10,6]) ).

tff(12,plain,
    ! [H: $i,G: $i] :
      ( ~ r0(G)
      | ~ p2(G,H,G)
      | l3(G,H) ),
    inference(skolemize,[status(sab)],[11]) ).

tff(13,plain,
    ! [H: $i,G: $i] :
      ( ~ r0(G)
      | ~ p2(G,H,G)
      | l3(G,H) ),
    inference(modus_ponens,[status(thm)],[12,5]) ).

tff(14,plain,
    ( r0(e)
  <=> r0(e) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,axiom,
    r0(e),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_13) ).

tff(16,plain,
    r0(e),
    inference(modus_ponens,[status(thm)],[15,14]) ).

tff(17,plain,
    ( ( ~ ! [H: $i,G: $i] :
            ( ~ r0(G)
            | ~ p2(G,H,G)
            | l3(G,H) )
      | ~ r0(e)
      | ~ p2(e,b,e)
      | l3(e,b) )
  <=> ( ~ ! [H: $i,G: $i] :
            ( ~ r0(G)
            | ~ p2(G,H,G)
            | l3(G,H) )
      | ~ r0(e)
      | ~ p2(e,b,e)
      | l3(e,b) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(18,plain,
    ( ~ ! [H: $i,G: $i] :
          ( ~ r0(G)
          | ~ p2(G,H,G)
          | l3(G,H) )
    | ~ r0(e)
    | ~ p2(e,b,e)
    | l3(e,b) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(19,plain,
    ( ~ ! [H: $i,G: $i] :
          ( ~ r0(G)
          | ~ p2(G,H,G)
          | l3(G,H) )
    | ~ r0(e)
    | ~ p2(e,b,e)
    | l3(e,b) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

tff(20,plain,
    ~ p2(e,b,e),
    inference(unit_resolution,[status(thm)],[19,16,13,3]) ).

tff(21,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(22,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)],[21]) ).

tff(23,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(24,axiom,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_176) ).

tff(25,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[24,23]) ).

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

tff(27,plain,
    ! [D: $i,E: $i] :
      ( p2(D,E,D)
      | ~ m1(E,D,E) ),
    inference(modus_ponens,[status(thm)],[26,22]) ).

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

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

tff(30,plain,
    ( ~ ! [D: $i,E: $i] :
          ( p2(D,E,D)
          | ~ m1(E,D,E) )
    | p2(e,b,e)
    | ~ m1(b,e,b) ),
    inference(modus_ponens,[status(thm)],[29,28]) ).

tff(31,plain,
    ~ m1(b,e,b),
    inference(unit_resolution,[status(thm)],[30,27,20]) ).

tff(32,plain,
    ^ [I: $i,H: $i] :
      refl(( ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) )
      <=> ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) ) )),
    inference(bind,[status(th)],[]) ).

tff(33,plain,
    ( ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) )
  <=> ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) ) ),
    inference(quant_intro,[status(thm)],[32]) ).

tff(34,plain,
    ( ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) )
  <=> ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(35,plain,
    ^ [I: $i,H: $i] :
      trans(monotonicity(rewrite(( ( m1(H,I,H)
              | ~ p0(H,I) )
          <=> ( m1(H,I,H)
              | ~ p0(H,I) ) )),
          ( ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
        <=> ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) ) )),
        rewrite(( ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
        <=> ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) ) )),
        ( ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) )
      <=> ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) ) )),
    inference(bind,[status(th)],[]) ).

tff(36,plain,
    ( ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) )
  <=> ! [I: $i,H: $i] :
        ( m1(H,I,H)
        | ~ p0(H,I)
        | ~ s0(H) ) ),
    inference(quant_intro,[status(thm)],[35]) ).

tff(37,axiom,
    ! [I: $i,H: $i] :
      ( m1(H,I,H)
      | ~ p0(H,I)
      | ~ s0(H) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_029) ).

tff(38,plain,
    ! [I: $i,H: $i] :
      ( m1(H,I,H)
      | ~ p0(H,I)
      | ~ s0(H) ),
    inference(modus_ponens,[status(thm)],[37,36]) ).

tff(39,plain,
    ! [I: $i,H: $i] :
      ( m1(H,I,H)
      | ~ p0(H,I)
      | ~ s0(H) ),
    inference(modus_ponens,[status(thm)],[38,34]) ).

tff(40,plain,
    ! [I: $i,H: $i] :
      ( m1(H,I,H)
      | ~ p0(H,I)
      | ~ s0(H) ),
    inference(skolemize,[status(sab)],[39]) ).

tff(41,plain,
    ! [I: $i,H: $i] :
      ( m1(H,I,H)
      | ~ p0(H,I)
      | ~ s0(H) ),
    inference(modus_ponens,[status(thm)],[40,33]) ).

tff(42,plain,
    ( s0(b)
  <=> s0(b) ),
    inference(rewrite,[status(thm)],[]) ).

tff(43,axiom,
    s0(b),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).

tff(44,plain,
    s0(b),
    inference(modus_ponens,[status(thm)],[43,42]) ).

tff(45,plain,
    ( ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | ~ s0(b)
      | m1(b,e,b)
      | ~ p0(b,e) )
  <=> ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | ~ s0(b)
      | m1(b,e,b)
      | ~ p0(b,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(46,plain,
    ( ( m1(b,e,b)
      | ~ p0(b,e)
      | ~ s0(b) )
  <=> ( ~ s0(b)
      | m1(b,e,b)
      | ~ p0(b,e) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(47,plain,
    ( ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | m1(b,e,b)
      | ~ p0(b,e)
      | ~ s0(b) )
  <=> ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | ~ s0(b)
      | m1(b,e,b)
      | ~ p0(b,e) ) ),
    inference(monotonicity,[status(thm)],[46]) ).

tff(48,plain,
    ( ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | m1(b,e,b)
      | ~ p0(b,e)
      | ~ s0(b) )
  <=> ( ~ ! [I: $i,H: $i] :
            ( m1(H,I,H)
            | ~ p0(H,I)
            | ~ s0(H) )
      | ~ s0(b)
      | m1(b,e,b)
      | ~ p0(b,e) ) ),
    inference(transitivity,[status(thm)],[47,45]) ).

tff(49,plain,
    ( ~ ! [I: $i,H: $i] :
          ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) )
    | m1(b,e,b)
    | ~ p0(b,e)
    | ~ s0(b) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(50,plain,
    ( ~ ! [I: $i,H: $i] :
          ( m1(H,I,H)
          | ~ p0(H,I)
          | ~ s0(H) )
    | ~ s0(b)
    | m1(b,e,b)
    | ~ p0(b,e) ),
    inference(modus_ponens,[status(thm)],[49,48]) ).

tff(51,plain,
    ~ p0(b,e),
    inference(unit_resolution,[status(thm)],[50,44,41,31]) ).

tff(52,plain,
    ^ [X: $i] :
      refl(( p0(b,X)
      <=> p0(b,X) )),
    inference(bind,[status(th)],[]) ).

tff(53,plain,
    ( ! [X: $i] : p0(b,X)
  <=> ! [X: $i] : p0(b,X) ),
    inference(quant_intro,[status(thm)],[52]) ).

tff(54,plain,
    ( ! [X: $i] : p0(b,X)
  <=> ! [X: $i] : p0(b,X) ),
    inference(rewrite,[status(thm)],[]) ).

tff(55,axiom,
    ! [X: $i] : p0(b,X),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

tff(56,plain,
    ! [X: $i] : p0(b,X),
    inference(modus_ponens,[status(thm)],[55,54]) ).

tff(57,plain,
    ! [X: $i] : p0(b,X),
    inference(skolemize,[status(sab)],[56]) ).

tff(58,plain,
    ! [X: $i] : p0(b,X),
    inference(modus_ponens,[status(thm)],[57,53]) ).

tff(59,plain,
    ( ~ ! [X: $i] : p0(b,X)
    | p0(b,e) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(60,plain,
    $false,
    inference(unit_resolution,[status(thm)],[59,58,51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : SYN235-1 : TPTP v9.0.0. Released v1.1.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n012.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 12:28:55 EDT 2025
% 0.11/0.32  % CPUTime    : 
% 0.18/0.45  % SZS status Unsatisfiable
% 0.18/0.45  % SZS output start Proof
% See solution above
% 0.18/0.47  % E exiting
%------------------------------------------------------------------------------