↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n013.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:41 AM UTC 2025

% Result   : Unsatisfiable 0.23s 0.52s
% Output   : Proof 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   20 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   66 (  31   ~;  27   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    2 (   2 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   34 (  30   !;   0   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
tff(q1_type,type,
    q1: ( $i * $i * $i ) > $o ).

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

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

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

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

tff(2,axiom,
    ~ q1(d,b,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

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

tff(4,plain,
    ^ [F: $i,G: $i] :
      refl(( ( ~ p0(G,F)
          | q1(F,G,G) )
      <=> ( ~ p0(G,F)
          | q1(F,G,G) ) )),
    inference(bind,[status(th)],[]) ).

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

tff(6,plain,
    ( ! [F: $i,G: $i] :
        ( ~ p0(G,F)
        | q1(F,G,G) )
  <=> ! [F: $i,G: $i] :
        ( ~ p0(G,F)
        | q1(F,G,G) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(7,plain,
    ^ [F: $i,G: $i] :
      rewrite(( ( q1(F,G,G)
          | ~ p0(G,F) )
      <=> ( ~ p0(G,F)
          | q1(F,G,G) ) )),
    inference(bind,[status(th)],[]) ).

tff(8,plain,
    ( ! [F: $i,G: $i] :
        ( q1(F,G,G)
        | ~ p0(G,F) )
  <=> ! [F: $i,G: $i] :
        ( ~ p0(G,F)
        | q1(F,G,G) ) ),
    inference(quant_intro,[status(thm)],[7]) ).

tff(9,axiom,
    ! [F: $i,G: $i] :
      ( q1(F,G,G)
      | ~ p0(G,F) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_095) ).

tff(10,plain,
    ! [F: $i,G: $i] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(modus_ponens,[status(thm)],[9,8]) ).

tff(11,plain,
    ! [F: $i,G: $i] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(modus_ponens,[status(thm)],[10,6]) ).

tff(12,plain,
    ! [F: $i,G: $i] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(skolemize,[status(sab)],[11]) ).

tff(13,plain,
    ! [F: $i,G: $i] :
      ( ~ p0(G,F)
      | q1(F,G,G) ),
    inference(modus_ponens,[status(thm)],[12,5]) ).

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

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

tff(16,plain,
    p0(b,d),
    inference(modus_ponens,[status(thm)],[15,14]) ).

tff(17,plain,
    ( ( ~ ! [F: $i,G: $i] :
            ( ~ p0(G,F)
            | q1(F,G,G) )
      | ~ p0(b,d)
      | q1(d,b,b) )
  <=> ( ~ ! [F: $i,G: $i] :
            ( ~ p0(G,F)
            | q1(F,G,G) )
      | ~ p0(b,d)
      | q1(d,b,b) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(18,plain,
    ( ~ ! [F: $i,G: $i] :
          ( ~ p0(G,F)
          | q1(F,G,G) )
    | ~ p0(b,d)
    | q1(d,b,b) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(19,plain,
    ( ~ ! [F: $i,G: $i] :
          ( ~ p0(G,F)
          | q1(F,G,G) )
    | ~ p0(b,d)
    | q1(d,b,b) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

tff(20,plain,
    $false,
    inference(unit_resolution,[status(thm)],[19,16,13,3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.15  % Problem    : SYN292-1 : TPTP v9.0.0. Released v1.1.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n013.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Fri Jun 20 12:30:23 EDT 2025
% 0.14/0.37  % CPUTime    : 
% 0.23/0.52  % SZS status Unsatisfiable
% 0.23/0.52  % SZS output start Proof
% See solution above
% 0.23/0.52  % E exiting
%------------------------------------------------------------------------------