↑ Up

Z3---4.15.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Z3---4.15.1
% Problem  : GRP170-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp
% Command  : run_E %s %d THM

% Computer : n005.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:07:20 AM UTC 2025

% Result   : Unsatisfiable 0.20s 0.37s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   71 (  55 unt;   0 typ;   0 def)
%            Number of atoms       :   95 (  90 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   29 (   9   ~;   5   |;   0   &)
%                                         (  15 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of FOOLs       :    4 (   4 fml;   0 var)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  112 ( 101   !;   0   ?; 112   :)

% Comments : 
%------------------------------------------------------------------------------
tff(multiply_type,type,
    multiply: ( $i * $i ) > $i ).

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

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

tff(greatest_lower_bound_type,type,
    greatest_lower_bound: ( $i * $i ) > $i ).

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

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

tff(least_upper_bound_type,type,
    least_upper_bound: ( $i * $i ) > $i ).

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

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

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

tff(4,axiom,
    ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).

tff(5,plain,
    ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
    inference(modus_ponens,[status(thm)],[4,3]) ).

tff(6,plain,
    ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
    inference(skolemize,[status(sab)],[5]) ).

tff(7,plain,
    ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X ),
    inference(modus_ponens,[status(thm)],[6,2]) ).

tff(8,plain,
    ( ~ ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X )
    | ( greatest_lower_bound(c,least_upper_bound(c,d)) = c ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(9,plain,
    greatest_lower_bound(c,least_upper_bound(c,d)) = c,
    inference(unit_resolution,[status(thm)],[8,7]) ).

tff(10,plain,
    ( ( least_upper_bound(c,d) = d )
  <=> ( least_upper_bound(c,d) = d ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(11,axiom,
    least_upper_bound(c,d) = d,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03c_2) ).

tff(12,plain,
    least_upper_bound(c,d) = d,
    inference(modus_ponens,[status(thm)],[11,10]) ).

tff(13,plain,
    d = least_upper_bound(c,d),
    inference(symmetry,[status(thm)],[12]) ).

tff(14,plain,
    greatest_lower_bound(c,d) = greatest_lower_bound(c,least_upper_bound(c,d)),
    inference(monotonicity,[status(thm)],[13]) ).

tff(15,plain,
    greatest_lower_bound(c,d) = c,
    inference(transitivity,[status(thm)],[14,9]) ).

tff(16,plain,
    multiply(a,greatest_lower_bound(c,d)) = multiply(a,c),
    inference(monotonicity,[status(thm)],[15]) ).

tff(17,plain,
    ^ [Z: $i,Y: $i,X: $i] :
      refl(( ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) )
      <=> ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ) )),
    inference(bind,[status(th)],[]) ).

tff(18,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ) ),
    inference(quant_intro,[status(thm)],[17]) ).

tff(19,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(20,axiom,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).

tff(21,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
    inference(modus_ponens,[status(thm)],[20,19]) ).

tff(22,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
    inference(skolemize,[status(sab)],[21]) ).

tff(23,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ),
    inference(modus_ponens,[status(thm)],[22,18]) ).

tff(24,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) )
    | ( multiply(a,greatest_lower_bound(c,d)) = greatest_lower_bound(multiply(a,c),multiply(a,d)) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(25,plain,
    multiply(a,greatest_lower_bound(c,d)) = greatest_lower_bound(multiply(a,c),multiply(a,d)),
    inference(unit_resolution,[status(thm)],[24,23]) ).

tff(26,plain,
    greatest_lower_bound(multiply(a,c),multiply(a,d)) = multiply(a,greatest_lower_bound(c,d)),
    inference(symmetry,[status(thm)],[25]) ).

tff(27,plain,
    ( ~ ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X )
    | ( greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = multiply(a,d) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(28,plain,
    greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = multiply(a,d),
    inference(unit_resolution,[status(thm)],[27,7]) ).

tff(29,plain,
    ( ( least_upper_bound(a,b) = b )
  <=> ( least_upper_bound(a,b) = b ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(30,axiom,
    least_upper_bound(a,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03c_1) ).

tff(31,plain,
    least_upper_bound(a,b) = b,
    inference(modus_ponens,[status(thm)],[30,29]) ).

tff(32,plain,
    b = least_upper_bound(a,b),
    inference(symmetry,[status(thm)],[31]) ).

tff(33,plain,
    multiply(b,d) = multiply(least_upper_bound(a,b),d),
    inference(monotonicity,[status(thm)],[32]) ).

tff(34,plain,
    multiply(least_upper_bound(a,b),d) = multiply(b,d),
    inference(symmetry,[status(thm)],[33]) ).

tff(35,plain,
    ^ [Z: $i,Y: $i,X: $i] :
      refl(( ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) )
      <=> ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ) )),
    inference(bind,[status(th)],[]) ).

tff(36,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ) ),
    inference(quant_intro,[status(thm)],[35]) ).

tff(37,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(38,axiom,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).

tff(39,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
    inference(modus_ponens,[status(thm)],[38,37]) ).

tff(40,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
    inference(skolemize,[status(sab)],[39]) ).

tff(41,plain,
    ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) ),
    inference(modus_ponens,[status(thm)],[40,36]) ).

tff(42,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : ( multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)) )
    | ( multiply(least_upper_bound(a,b),d) = least_upper_bound(multiply(a,d),multiply(b,d)) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(43,plain,
    multiply(least_upper_bound(a,b),d) = least_upper_bound(multiply(a,d),multiply(b,d)),
    inference(unit_resolution,[status(thm)],[42,41]) ).

tff(44,plain,
    least_upper_bound(multiply(a,d),multiply(b,d)) = multiply(least_upper_bound(a,b),d),
    inference(symmetry,[status(thm)],[43]) ).

tff(45,plain,
    least_upper_bound(multiply(a,d),multiply(b,d)) = multiply(b,d),
    inference(transitivity,[status(thm)],[44,34]) ).

tff(46,plain,
    least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))) = least_upper_bound(multiply(a,d),multiply(b,d)),
    inference(monotonicity,[status(thm)],[45]) ).

tff(47,plain,
    least_upper_bound(multiply(a,d),multiply(b,d)) = least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(symmetry,[status(thm)],[46]) ).

tff(48,plain,
    multiply(b,d) = least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(transitivity,[status(thm)],[33,43,47]) ).

tff(49,plain,
    greatest_lower_bound(multiply(a,d),multiply(b,d)) = greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))),
    inference(monotonicity,[status(thm)],[48]) ).

tff(50,plain,
    greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))) = greatest_lower_bound(multiply(a,d),multiply(b,d)),
    inference(monotonicity,[status(thm)],[45]) ).

tff(51,plain,
    greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))) = multiply(a,d),
    inference(transitivity,[status(thm)],[50,49,28]) ).

tff(52,plain,
    greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = greatest_lower_bound(multiply(a,c),multiply(a,d)),
    inference(monotonicity,[status(thm)],[51]) ).

tff(53,plain,
    ^ [Z: $i,Y: $i,X: $i] :
      refl(( ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) )
      <=> ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ) )),
    inference(bind,[status(th)],[]) ).

tff(54,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ) ),
    inference(quant_intro,[status(thm)],[53]) ).

tff(55,plain,
    ( ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) )
  <=> ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(56,axiom,
    ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).

tff(57,plain,
    ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
    inference(modus_ponens,[status(thm)],[56,55]) ).

tff(58,plain,
    ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
    inference(skolemize,[status(sab)],[57]) ).

tff(59,plain,
    ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ),
    inference(modus_ponens,[status(thm)],[58,54]) ).

tff(60,plain,
    ( ~ ! [Z: $i,Y: $i,X: $i] : ( greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) )
    | ( greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))) ) ),
    inference(quant_inst,[status(thm)],[]) ).

tff(61,plain,
    greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(unit_resolution,[status(thm)],[60,59]) ).

tff(62,plain,
    greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))) = greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))),
    inference(symmetry,[status(thm)],[61]) ).

tff(63,plain,
    multiply(b,d) = least_upper_bound(multiply(a,d),multiply(b,d)),
    inference(transitivity,[status(thm)],[33,43]) ).

tff(64,plain,
    multiply(a,c) = multiply(a,greatest_lower_bound(c,d)),
    inference(symmetry,[status(thm)],[16]) ).

tff(65,plain,
    multiply(a,c) = greatest_lower_bound(multiply(a,c),multiply(a,d)),
    inference(transitivity,[status(thm)],[64,25]) ).

tff(66,plain,
    greatest_lower_bound(multiply(a,c),multiply(b,d)) = greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))),
    inference(monotonicity,[status(thm)],[65,63]) ).

tff(67,plain,
    greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c),
    inference(transitivity,[status(thm)],[66,62,52,26,16]) ).

tff(68,plain,
    ( ( greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c) )
  <=> ( greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c) ) ),
    inference(rewrite,[status(thm)],[]) ).

tff(69,axiom,
    greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03c) ).

tff(70,plain,
    greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
    inference(modus_ponens,[status(thm)],[69,68]) ).

tff(71,plain,
    $false,
    inference(unit_resolution,[status(thm)],[70,67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP170-3 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n005.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   : Thu Jun 19 15:44:35 EDT 2025
% 0.11/0.33  % CPUTime    : 
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output start Proof
% See solution above
% 0.20/0.38  % E exiting
%------------------------------------------------------------------------------