↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n008.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:24 AM UTC 2025

% Result   : Unsatisfiable 0.17s 0.45s
% Output   : Proof 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   65 (  20 unt;   0 typ;   0 def)
%            Number of atoms       :  238 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  304 ( 144   ~; 132   |;   0   &)
%                                         (  28 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   13 (  13 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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :  136 ( 123   !;   0   ?; 136   :)

% Comments : 
%------------------------------------------------------------------------------
tff(p3_type,type,
    p3: ( $i * $i * $i ) > $o ).

tff(d_type,type,
    d: $i ).

tff(n2_type,type,
    n2: $i > $o ).

tff(p1_type,type,
    p1: ( $i * $i * $i ) > $o ).

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

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

tff(k1_type,type,
    k1: $i > $o ).

tff(n0_type,type,
    n0: ( $i * $i ) > $o ).

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

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

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

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

tff(4,plain,
    ^ [B: $i,C: $i] :
      rewrite(( ( p1(B,B,B)
          | ~ p0(C,B) )
      <=> ( ~ p0(C,B)
          | p1(B,B,B) ) )),
    inference(bind,[status(th)],[]) ).

tff(5,plain,
    ( ! [B: $i,C: $i] :
        ( p1(B,B,B)
        | ~ p0(C,B) )
  <=> ! [B: $i,C: $i] :
        ( ~ p0(C,B)
        | p1(B,B,B) ) ),
    inference(quant_intro,[status(thm)],[4]) ).

tff(6,axiom,
    ! [B: $i,C: $i] :
      ( p1(B,B,B)
      | ~ p0(C,B) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).

tff(7,plain,
    ! [B: $i,C: $i] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(modus_ponens,[status(thm)],[6,5]) ).

tff(8,plain,
    ! [B: $i,C: $i] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(modus_ponens,[status(thm)],[7,3]) ).

tff(9,plain,
    ! [B: $i,C: $i] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(skolemize,[status(sab)],[8]) ).

tff(10,plain,
    ! [B: $i,C: $i] :
      ( ~ p0(C,B)
      | p1(B,B,B) ),
    inference(modus_ponens,[status(thm)],[9,2]) ).

tff(11,plain,
    ( p0(b,d)
  <=> p0(b,d) ),
    inference(rewrite,[status(thm)],[]) ).

tff(12,axiom,
    p0(b,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_10) ).

tff(13,plain,
    p0(b,d),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ( ( ~ ! [B: $i,C: $i] :
            ( ~ p0(C,B)
            | p1(B,B,B) )
      | ~ p0(b,d)
      | p1(d,d,d) )
  <=> ( ~ ! [B: $i,C: $i] :
            ( ~ p0(C,B)
            | p1(B,B,B) )
      | ~ p0(b,d)
      | p1(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,plain,
    ( ~ ! [B: $i,C: $i] :
          ( ~ p0(C,B)
          | p1(B,B,B) )
    | ~ p0(b,d)
    | p1(d,d,d) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(16,plain,
    ( ~ ! [B: $i,C: $i] :
          ( ~ p0(C,B)
          | p1(B,B,B) )
    | ~ p0(b,d)
    | p1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[15,14]) ).

tff(17,plain,
    p1(d,d,d),
    inference(unit_resolution,[status(thm)],[16,13,10]) ).

tff(18,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(( ( n2(A)
          | ~ p1(B,C,A) )
      <=> ( n2(A)
          | ~ p1(B,C,A) ) )),
    inference(bind,[status(th)],[]) ).

tff(19,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) ) ),
    inference(quant_intro,[status(thm)],[18]) ).

tff(20,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( n2(A)
        | ~ p1(B,C,A) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(21,axiom,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).

tff(22,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[21,20]) ).

tff(23,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(skolemize,[status(sab)],[22]) ).

tff(24,plain,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    inference(modus_ponens,[status(thm)],[23,19]) ).

tff(25,plain,
    ( ( ~ ! [B: $i,A: $i,C: $i] :
            ( n2(A)
            | ~ p1(B,C,A) )
      | n2(d)
      | ~ p1(d,d,d) )
  <=> ( ~ ! [B: $i,A: $i,C: $i] :
            ( n2(A)
            | ~ p1(B,C,A) )
      | n2(d)
      | ~ p1(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(26,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( n2(A)
          | ~ p1(B,C,A) )
    | n2(d)
    | ~ p1(d,d,d) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(27,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( n2(A)
          | ~ p1(B,C,A) )
    | n2(d)
    | ~ p1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[26,25]) ).

tff(28,plain,
    n2(d),
    inference(unit_resolution,[status(thm)],[27,24,17]) ).

tff(29,plain,
    ^ [H: $i] :
      refl(( ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
      <=> ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(30,plain,
    ( ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(quant_intro,[status(thm)],[29]) ).

tff(31,plain,
    ( ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(32,plain,
    ^ [H: $i] :
      trans(monotonicity(rewrite(( ( p3(H,H,H)
              | ~ k1(H) )
          <=> ( ~ k1(H)
              | p3(H,H,H) ) )),
          ( ( p3(H,H,H)
            | ~ k1(H)
            | ~ n2(H) )
        <=> ( ~ k1(H)
            | p3(H,H,H)
            | ~ n2(H) ) )),
        rewrite(( ( ~ k1(H)
            | p3(H,H,H)
            | ~ n2(H) )
        <=> ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) ) )),
        ( ( p3(H,H,H)
          | ~ k1(H)
          | ~ n2(H) )
      <=> ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) ) )),
    inference(bind,[status(th)],[]) ).

tff(33,plain,
    ( ! [H: $i] :
        ( p3(H,H,H)
        | ~ k1(H)
        | ~ n2(H) )
  <=> ! [H: $i] :
        ( ~ k1(H)
        | ~ n2(H)
        | p3(H,H,H) ) ),
    inference(quant_intro,[status(thm)],[32]) ).

tff(34,axiom,
    ! [H: $i] :
      ( p3(H,H,H)
      | ~ k1(H)
      | ~ n2(H) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_249) ).

tff(35,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[34,33]) ).

tff(36,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[35,31]) ).

tff(37,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(skolemize,[status(sab)],[36]) ).

tff(38,plain,
    ! [H: $i] :
      ( ~ k1(H)
      | ~ n2(H)
      | p3(H,H,H) ),
    inference(modus_ponens,[status(thm)],[37,30]) ).

tff(39,plain,
    ^ [I: $i,J: $i] :
      refl(( ( k1(I)
          | ~ n0(J,I) )
      <=> ( k1(I)
          | ~ n0(J,I) ) )),
    inference(bind,[status(th)],[]) ).

tff(40,plain,
    ( ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) )
  <=> ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) ) ),
    inference(quant_intro,[status(thm)],[39]) ).

tff(41,plain,
    ( ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) )
  <=> ! [I: $i,J: $i] :
        ( k1(I)
        | ~ n0(J,I) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(42,axiom,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

tff(43,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[42,41]) ).

tff(44,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(skolemize,[status(sab)],[43]) ).

tff(45,plain,
    ! [I: $i,J: $i] :
      ( k1(I)
      | ~ n0(J,I) ),
    inference(modus_ponens,[status(thm)],[44,40]) ).

tff(46,plain,
    ( n0(c,d)
  <=> n0(c,d) ),
    inference(rewrite,[status(thm)],[]) ).

tff(47,axiom,
    n0(c,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).

tff(48,plain,
    n0(c,d),
    inference(modus_ponens,[status(thm)],[47,46]) ).

tff(49,plain,
    ( ( ~ ! [I: $i,J: $i] :
            ( k1(I)
            | ~ n0(J,I) )
      | k1(d)
      | ~ n0(c,d) )
  <=> ( ~ ! [I: $i,J: $i] :
            ( k1(I)
            | ~ n0(J,I) )
      | k1(d)
      | ~ n0(c,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(50,plain,
    ( ~ ! [I: $i,J: $i] :
          ( k1(I)
          | ~ n0(J,I) )
    | k1(d)
    | ~ n0(c,d) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(51,plain,
    ( ~ ! [I: $i,J: $i] :
          ( k1(I)
          | ~ n0(J,I) )
    | k1(d)
    | ~ n0(c,d) ),
    inference(modus_ponens,[status(thm)],[50,49]) ).

tff(52,plain,
    k1(d),
    inference(unit_resolution,[status(thm)],[51,48,45]) ).

tff(53,plain,
    ( ( ~ ! [H: $i] :
            ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) )
      | ~ k1(d)
      | ~ n2(d)
      | p3(d,d,d) )
  <=> ( ~ ! [H: $i] :
            ( ~ k1(H)
            | ~ n2(H)
            | p3(H,H,H) )
      | ~ k1(d)
      | ~ n2(d)
      | p3(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(54,plain,
    ( ~ ! [H: $i] :
          ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
    | ~ k1(d)
    | ~ n2(d)
    | p3(d,d,d) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(55,plain,
    ( ~ ! [H: $i] :
          ( ~ k1(H)
          | ~ n2(H)
          | p3(H,H,H) )
    | ~ k1(d)
    | ~ n2(d)
    | p3(d,d,d) ),
    inference(modus_ponens,[status(thm)],[54,53]) ).

tff(56,plain,
    p3(d,d,d),
    inference(unit_resolution,[status(thm)],[55,52,38,28]) ).

tff(57,plain,
    ^ [Y: $i,X: $i] :
      refl(( ~ p3(X,d,Y)
      <=> ~ p3(X,d,Y) )),
    inference(bind,[status(th)],[]) ).

tff(58,plain,
    ( ! [Y: $i,X: $i] : ~ p3(X,d,Y)
  <=> ! [Y: $i,X: $i] : ~ p3(X,d,Y) ),
    inference(quant_intro,[status(thm)],[57]) ).

tff(59,plain,
    ( ! [Y: $i,X: $i] : ~ p3(X,d,Y)
  <=> ! [Y: $i,X: $i] : ~ p3(X,d,Y) ),
    inference(rewrite,[status(thm)],[]) ).

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

tff(61,plain,
    ! [Y: $i,X: $i] : ~ p3(X,d,Y),
    inference(modus_ponens,[status(thm)],[60,59]) ).

tff(62,plain,
    ! [Y: $i,X: $i] : ~ p3(X,d,Y),
    inference(skolemize,[status(sab)],[61]) ).

tff(63,plain,
    ! [Y: $i,X: $i] : ~ p3(X,d,Y),
    inference(modus_ponens,[status(thm)],[62,58]) ).

tff(64,plain,
    ( ~ ! [Y: $i,X: $i] : ~ p3(X,d,Y)
    | ~ p3(d,d,d) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(65,plain,
    $false,
    inference(unit_resolution,[status(thm)],[64,63,56]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SYN169-1 : TPTP v9.0.0. Released v1.1.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n008.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:29:03 EDT 2025
% 0.11/0.32  % CPUTime    : 
% 0.17/0.45  % SZS status Unsatisfiable
% 0.17/0.45  % SZS output start Proof
% See solution above
% 0.17/0.47  % E exiting
%------------------------------------------------------------------------------