↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : SYN255-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:36 AM UTC 2025

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   23 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   70 (  33   ~;  29   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 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    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   39 (  36   !;   0   ?;  39   :)

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

tff(a_type,type,
    a: $i ).

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

tff(l0_type,type,
    l0: $i > $o ).

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

tff(2,axiom,
    ~ n2(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

tff(3,plain,
    ~ n2(a),
    inference(modus_ponens,[status(thm)],[2,1]) ).

tff(4,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(5,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)],[4]) ).

tff(6,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(7,axiom,
    ! [B: $i,A: $i,C: $i] :
      ( n2(A)
      | ~ p1(B,C,A) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).

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

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

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

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

tff(12,axiom,
    l0(a),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).

tff(13,plain,
    l0(a),
    inference(modus_ponens,[status(thm)],[12,11]) ).

tff(14,plain,
    ( ( ~ l0(a)
      | p1(a,a,a) )
  <=> ( ~ l0(a)
      | p1(a,a,a) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(15,plain,
    ( ( p1(a,a,a)
      | ~ l0(a) )
  <=> ( ~ l0(a)
      | p1(a,a,a) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(16,axiom,
    ( p1(a,a,a)
    | ~ l0(a) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_088) ).

tff(17,plain,
    ( ~ l0(a)
    | p1(a,a,a) ),
    inference(modus_ponens,[status(thm)],[16,15]) ).

tff(18,plain,
    ( ~ l0(a)
    | p1(a,a,a) ),
    inference(modus_ponens,[status(thm)],[17,14]) ).

tff(19,plain,
    p1(a,a,a),
    inference(unit_resolution,[status(thm)],[18,13]) ).

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

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

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

tff(23,plain,
    $false,
    inference(unit_resolution,[status(thm)],[22,19,10,3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : SYN255-1 : TPTP v9.0.0. Released v1.1.0.
% 0.02/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:30:03 EDT 2025
% 0.11/0.33  % CPUTime    : 
% 0.19/0.46  % SZS status Unsatisfiable
% 0.19/0.46  % SZS output start Proof
% See solution above
% 0.19/0.47  % E exiting
%------------------------------------------------------------------------------