TSTP Solution File: GRP665-10 by Z3---4.8.9.0

View Problem - Process Solution

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

% 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 : Fri Sep 16 22:29:20 EDT 2022

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   48 (  31 unt;   5 typ;   0 def)
%            Number of atoms       :   61 (  57 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   24 (   9   ~;   5   |;   0   &)
%                                         (  10 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    3 (   3 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    4 (   2   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   62 (  56   !;   0   ?;  62   :)

% Comments : 
%------------------------------------------------------------------------------
tff(mult_type,type,
    mult: ( $i * $i ) > $i ).

tff(x1_type,type,
    x1: $i ).

tff(x0_type,type,
    x0: $i ).

tff(op_c_type,type,
    op_c: $i ).

tff(ld_type,type,
    ld: ( $i * $i ) > $i ).

tff(1,plain,
    ^ [A: $i] :
      refl(
        ( ( mult(op_c,A) = mult(A,op_c) )
      <=> ( mult(op_c,A) = mult(A,op_c) ) )),
    inference(bind,[status(th)],]) ).

tff(2,plain,
    ( ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) )
  <=> ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ) ),
    inference(quant_intro,[status(thm)],[1]) ).

tff(3,plain,
    ( ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) )
  <=> ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(4,axiom,
    ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

tff(5,plain,
    ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) )
    | ( mult(op_c,x1) = mult(x1,op_c) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(9,plain,
    mult(op_c,x1) = mult(x1,op_c),
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    mult(x1,op_c) = mult(op_c,x1),
    inference(symmetry,[status(thm)],[9]) ).

tff(11,plain,
    ld(op_c,mult(x1,op_c)) = ld(op_c,mult(op_c,x1)),
    inference(monotonicity,[status(thm)],[10]) ).

tff(12,plain,
    ld(op_c,mult(op_c,x1)) = ld(op_c,mult(x1,op_c)),
    inference(symmetry,[status(thm)],[11]) ).

tff(13,plain,
    ^ [B: $i,A: $i] :
      refl(
        ( ( ld(A,mult(A,B)) = B )
      <=> ( ld(A,mult(A,B)) = B ) )),
    inference(bind,[status(th)],]) ).

tff(14,plain,
    ( ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
  <=> ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ) ),
    inference(quant_intro,[status(thm)],[13]) ).

tff(15,plain,
    ( ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
  <=> ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ) ),
    inference(rewrite,[status(thm)],]) ).

tff(16,axiom,
    ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

tff(17,plain,
    ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
    inference(modus_ponens,[status(thm)],[16,15]) ).

tff(18,plain,
    ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
    inference(skolemize,[status(sab)],[17]) ).

tff(19,plain,
    ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
    inference(modus_ponens,[status(thm)],[18,14]) ).

tff(20,plain,
    ( ~ ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
    | ( ld(op_c,mult(op_c,x1)) = x1 ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(21,plain,
    ld(op_c,mult(op_c,x1)) = x1,
    inference(unit_resolution,[status(thm)],[20,19]) ).

tff(22,plain,
    x1 = ld(op_c,mult(op_c,x1)),
    inference(symmetry,[status(thm)],[21]) ).

tff(23,plain,
    x1 = ld(op_c,mult(x1,op_c)),
    inference(transitivity,[status(thm)],[22,12]) ).

tff(24,plain,
    ( ~ ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) )
    | ( mult(op_c,x0) = mult(x0,op_c) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(25,plain,
    mult(op_c,x0) = mult(x0,op_c),
    inference(unit_resolution,[status(thm)],[24,7]) ).

tff(26,plain,
    mult(mult(op_c,x0),x1) = mult(mult(x0,op_c),ld(op_c,mult(x1,op_c))),
    inference(monotonicity,[status(thm)],[25,23]) ).

tff(27,plain,
    mult(mult(x0,op_c),ld(op_c,mult(x1,op_c))) = mult(mult(op_c,x0),x1),
    inference(symmetry,[status(thm)],[26]) ).

tff(28,plain,
    ^ [B: $i,A: $i,C: $i] :
      refl(
        ( ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) )
      <=> ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ) )),
    inference(bind,[status(th)],]) ).

tff(29,plain,
    ( ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) )
  <=> ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ) ),
    inference(quant_intro,[status(thm)],[28]) ).

tff(30,plain,
    ( ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) )
  <=> ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(31,axiom,
    ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

tff(32,plain,
    ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
    inference(modus_ponens,[status(thm)],[31,30]) ).

tff(33,plain,
    ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
    inference(skolemize,[status(sab)],[32]) ).

tff(34,plain,
    ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) ),
    inference(modus_ponens,[status(thm)],[33,29]) ).

tff(35,plain,
    ( ~ ! [B: $i,A: $i,C: $i] : ( mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))) )
    | ( mult(mult(x0,x1),op_c) = mult(mult(x0,op_c),ld(op_c,mult(x1,op_c))) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(36,plain,
    mult(mult(x0,x1),op_c) = mult(mult(x0,op_c),ld(op_c,mult(x1,op_c))),
    inference(unit_resolution,[status(thm)],[35,34]) ).

tff(37,plain,
    ( ~ ! [A: $i] : ( mult(op_c,A) = mult(A,op_c) )
    | ( mult(op_c,mult(x0,x1)) = mult(mult(x0,x1),op_c) ) ),
    inference(quant_inst,[status(thm)],]) ).

tff(38,plain,
    mult(op_c,mult(x0,x1)) = mult(mult(x0,x1),op_c),
    inference(unit_resolution,[status(thm)],[37,7]) ).

tff(39,plain,
    mult(op_c,mult(x0,x1)) = mult(mult(op_c,x0),x1),
    inference(transitivity,[status(thm)],[38,36,27]) ).

tff(40,plain,
    ( ( mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1) )
  <=> ( mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1) ) ),
    inference(rewrite,[status(thm)],]) ).

tff(41,axiom,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

tff(42,plain,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    inference(modus_ponens,[status(thm)],[41,40]) ).

tff(43,plain,
    $false,
    inference(unit_resolution,[status(thm)],[42,39]) ).

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