↑ Up

Z3---4.15.1.UNS-Prf.s

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

% Computer : n010.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.19s 0.47s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   27 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   69 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   84 (  43   ~;  31   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :    1 (   1 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   :   20 (  18   !;   0   ?;  20   :)

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

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

tff(k0_type,type,
    k0: $i > $o ).

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

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

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

tff(2,plain,
    ( ! [Y: $i,X: $i] : ~ q1(d,X,Y)
  <=> ! [Y: $i,X: $i] : ~ q1(d,X,Y) ),
    inference(quant_intro,[status(thm)],[1]) ).

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

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

tff(5,plain,
    ! [Y: $i,X: $i] : ~ q1(d,X,Y),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [Y: $i,X: $i] : ~ q1(d,X,Y),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [Y: $i,X: $i] : ~ q1(d,X,Y),
    inference(modus_ponens,[status(thm)],[6,2]) ).

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

tff(9,axiom,
    k0(e),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).

tff(10,plain,
    k0(e),
    inference(modus_ponens,[status(thm)],[9,8]) ).

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

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

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

tff(14,plain,
    ( ( ~ s0(d)
      | ~ k0(e)
      | q1(d,d,d) )
  <=> ( ~ s0(d)
      | ~ k0(e)
      | q1(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,plain,
    ( ( ~ k0(e)
      | q1(d,d,d)
      | ~ s0(d) )
  <=> ( ~ s0(d)
      | ~ k0(e)
      | q1(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(16,plain,
    ( ( q1(d,d,d)
      | ~ k0(e) )
  <=> ( ~ k0(e)
      | q1(d,d,d) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(17,plain,
    ( ( q1(d,d,d)
      | ~ k0(e)
      | ~ s0(d) )
  <=> ( ~ k0(e)
      | q1(d,d,d)
      | ~ s0(d) ) ),
    inference(monotonicity,[status(thm)],[16]) ).

tff(18,plain,
    ( ( q1(d,d,d)
      | ~ k0(e)
      | ~ s0(d) )
  <=> ( ~ s0(d)
      | ~ k0(e)
      | q1(d,d,d) ) ),
    inference(transitivity,[status(thm)],[17,15]) ).

tff(19,axiom,
    ( q1(d,d,d)
    | ~ k0(e)
    | ~ s0(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_117) ).

tff(20,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[19,18]) ).

tff(21,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[20,14]) ).

tff(22,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[21,14]) ).

tff(23,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[22,14]) ).

tff(24,plain,
    ( ~ s0(d)
    | ~ k0(e)
    | q1(d,d,d) ),
    inference(modus_ponens,[status(thm)],[23,14]) ).

tff(25,plain,
    q1(d,d,d),
    inference(unit_resolution,[status(thm)],[24,13,10]) ).

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

tff(27,plain,
    $false,
    inference(unit_resolution,[status(thm)],[26,25,7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SYN291-1 : TPTP v9.0.0. Released v1.1.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n010.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Fri Jun 20 12:31:57 EDT 2025
% 0.11/0.33  % CPUTime    : 
% 0.19/0.47  % SZS status Unsatisfiable
% 0.19/0.47  % SZS output start Proof
% See solution above
% 0.19/0.47  % E exiting
%------------------------------------------------------------------------------