TSTP Solution File: GRP038-3 by Z3---4.8.9.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Z3---4.8.9.0
% Problem  : GRP038-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : z3_tptp -proof -model -t:%d -file:%s

% Computer : n002.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 : Fri Sep 16 22:25:36 EDT 2022

% Result   : Unsatisfiable 0.20s 0.39s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   32 (  11 unt;   6 typ;   0 def)
%            Number of atoms       :  136 (   0 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :  197 (  95   ~;  89   |;   0   &)
%                                         (  13 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of FOOLs       :    8 (   8 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   51 (  45   !;   0   ?;  51   :)

% Comments : 
%------------------------------------------------------------------------------
tff(subgroup_member_type,type,
    subgroup_member: $i > $o ).

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

tff(product_type,type,
    product: ( $i * $i * $i ) > $o ).

tff(inverse_type,type,
    inverse: $i > $i ).

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

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

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

tff(2,axiom,
    ~ subgroup_member(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_is_in_subgroup) ).

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

tff(4,plain,
    ( product(a,inverse(b),c)
  <=> product(a,inverse(b),c) ),
    inference(rewrite,[status(thm)],]) ).

tff(5,axiom,
    product(a,inverse(b),c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_inverse_b_is_c) ).

tff(6,plain,
    product(a,inverse(b),c),
    inference(modus_ponens,[status(thm)],[5,4]) ).

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

tff(8,axiom,
    subgroup_member(b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_in_subgroup) ).

tff(9,plain,
    subgroup_member(b),
    inference(modus_ponens,[status(thm)],[8,7]) ).

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

tff(11,axiom,
    subgroup_member(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_in_subgroup) ).

tff(12,plain,
    subgroup_member(a),
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(
        ( ( subgroup_member(C)
          | ~ product(A,inverse(B),C)
          | ~ subgroup_member(B)
          | ~ subgroup_member(A) )
      <=> ( subgroup_member(C)
          | ~ product(A,inverse(B),C)
          | ~ subgroup_member(B)
          | ~ subgroup_member(A) ) )),
    inference(bind,[status(th)],]) ).

tff(14,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( subgroup_member(C)
        | ~ product(A,inverse(B),C)
        | ~ subgroup_member(B)
        | ~ subgroup_member(A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( subgroup_member(C)
        | ~ product(A,inverse(B),C)
        | ~ subgroup_member(B)
        | ~ subgroup_member(A) ) ),
    inference(quant_intro,[status(thm)],[13]) ).

tff(15,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( subgroup_member(C)
        | ~ product(A,inverse(B),C)
        | ~ subgroup_member(B)
        | ~ subgroup_member(A) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( subgroup_member(C)
        | ~ product(A,inverse(B),C)
        | ~ subgroup_member(B)
        | ~ subgroup_member(A) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(16,plain,
    ^ [B: $i,A: $i,C: $i] :
      trans(
        monotonicity(
          rewrite(
            ( ( ~ subgroup_member(A)
              | ~ subgroup_member(B)
              | ~ product(A,inverse(B),C) )
          <=> ( ~ product(A,inverse(B),C)
              | ~ subgroup_member(B)
              | ~ subgroup_member(A) ) )),
          ( ( ~ subgroup_member(A)
            | ~ subgroup_member(B)
            | ~ product(A,inverse(B),C)
            | subgroup_member(C) )
        <=> ( ~ product(A,inverse(B),C)
            | ~ subgroup_member(B)
            | ~ subgroup_member(A)
            | subgroup_member(C) ) )),
        rewrite(
          ( ( ~ product(A,inverse(B),C)
            | ~ subgroup_member(B)
            | ~ subgroup_member(A)
            | subgroup_member(C) )
        <=> ( subgroup_member(C)
            | ~ product(A,inverse(B),C)
            | ~ subgroup_member(B)
            | ~ subgroup_member(A) ) )),
        ( ( ~ subgroup_member(A)
          | ~ subgroup_member(B)
          | ~ product(A,inverse(B),C)
          | subgroup_member(C) )
      <=> ( subgroup_member(C)
          | ~ product(A,inverse(B),C)
          | ~ subgroup_member(B)
          | ~ subgroup_member(A) ) )),
    inference(bind,[status(th)],]) ).

tff(17,plain,
    ( ! [B: $i,A: $i,C: $i] :
        ( ~ subgroup_member(A)
        | ~ subgroup_member(B)
        | ~ product(A,inverse(B),C)
        | subgroup_member(C) )
  <=> ! [B: $i,A: $i,C: $i] :
        ( subgroup_member(C)
        | ~ product(A,inverse(B),C)
        | ~ subgroup_member(B)
        | ~ subgroup_member(A) ) ),
    inference(quant_intro,[status(thm)],[16]) ).

tff(18,axiom,
    ! [B: $i,A: $i,C: $i] :
      ( ~ subgroup_member(A)
      | ~ subgroup_member(B)
      | ~ product(A,inverse(B),C)
      | subgroup_member(C) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP003-2.ax',closure_of_product_and_inverse) ).

tff(19,plain,
    ! [B: $i,A: $i,C: $i] :
      ( subgroup_member(C)
      | ~ product(A,inverse(B),C)
      | ~ subgroup_member(B)
      | ~ subgroup_member(A) ),
    inference(modus_ponens,[status(thm)],[18,17]) ).

tff(20,plain,
    ! [B: $i,A: $i,C: $i] :
      ( subgroup_member(C)
      | ~ product(A,inverse(B),C)
      | ~ subgroup_member(B)
      | ~ subgroup_member(A) ),
    inference(modus_ponens,[status(thm)],[19,15]) ).

tff(21,plain,
    ! [B: $i,A: $i,C: $i] :
      ( subgroup_member(C)
      | ~ product(A,inverse(B),C)
      | ~ subgroup_member(B)
      | ~ subgroup_member(A) ),
    inference(skolemize,[status(sab)],[20]) ).

tff(22,plain,
    ! [B: $i,A: $i,C: $i] :
      ( subgroup_member(C)
      | ~ product(A,inverse(B),C)
      | ~ subgroup_member(B)
      | ~ subgroup_member(A) ),
    inference(modus_ponens,[status(thm)],[21,14]) ).

tff(23,plain,
    ( ( ~ ! [B: $i,A: $i,C: $i] :
            ( subgroup_member(C)
            | ~ product(A,inverse(B),C)
            | ~ subgroup_member(B)
            | ~ subgroup_member(A) )
      | subgroup_member(c)
      | ~ product(a,inverse(b),c)
      | ~ subgroup_member(b)
      | ~ subgroup_member(a) )
  <=> ( ~ ! [B: $i,A: $i,C: $i] :
            ( subgroup_member(C)
            | ~ product(A,inverse(B),C)
            | ~ subgroup_member(B)
            | ~ subgroup_member(A) )
      | subgroup_member(c)
      | ~ product(a,inverse(b),c)
      | ~ subgroup_member(b)
      | ~ subgroup_member(a) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(24,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( subgroup_member(C)
          | ~ product(A,inverse(B),C)
          | ~ subgroup_member(B)
          | ~ subgroup_member(A) )
    | subgroup_member(c)
    | ~ product(a,inverse(b),c)
    | ~ subgroup_member(b)
    | ~ subgroup_member(a) ),
    inference(quant_inst,[status(thm)],]) ).

tff(25,plain,
    ( ~ ! [B: $i,A: $i,C: $i] :
          ( subgroup_member(C)
          | ~ product(A,inverse(B),C)
          | ~ subgroup_member(B)
          | ~ subgroup_member(A) )
    | subgroup_member(c)
    | ~ product(a,inverse(b),c)
    | ~ subgroup_member(b)
    | ~ subgroup_member(a) ),
    inference(modus_ponens,[status(thm)],[24,23]) ).

tff(26,plain,
    $false,
    inference(unit_resolution,[status(thm)],[25,22,12,9,6,3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP038-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.34  % Computer : n002.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Wed Aug 31 14:27:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34  Usage: tptp [options] [-file:]file
% 0.12/0.34    -h, -?       prints this message.
% 0.12/0.34    -smt2        print SMT-LIB2 benchmark.
% 0.12/0.34    -m, -model   generate model.
% 0.12/0.34    -p, -proof   generate proof.
% 0.12/0.34    -c, -core    generate unsat core of named formulas.
% 0.12/0.34    -st, -statistics display statistics.
% 0.12/0.34    -t:timeout   set timeout (in second).
% 0.12/0.34    -smt2status  display status in smt2 format instead of SZS.
% 0.12/0.34    -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34    -<param>:<value> configuration parameter and value.
% 0.12/0.34    -o:<output-file> file to place output in.
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------