%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : GRP175-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n003.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:21 AM UTC 2025
% Result : Unsatisfiable 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of formulae : 72 ( 54 unt; 0 typ; 0 def)
% Number of atoms : 100 ( 94 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 33 ( 10 ~; 6 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 5 ( 5 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 84 !; 0 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
tff(identity_type,type,
identity: $i ).
tff(greatest_lower_bound_type,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(multiply_type,type,
multiply: ( $i * $i ) > $i ).
tff(a_type,type,
a: $i ).
tff(b_type,type,
b: $i ).
tff(inverse_type,type,
inverse: $i > $i ).
tff(1,plain,
^ [X: $i] :
refl(( ( multiply(inverse(X),X) = identity )
<=> ( multiply(inverse(X),X) = identity ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [X: $i] : ( multiply(inverse(X),X) = identity )
<=> ! [X: $i] : ( multiply(inverse(X),X) = identity ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : ( multiply(inverse(X),X) = identity )
<=> ! [X: $i] : ( multiply(inverse(X),X) = identity ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
tff(5,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [X: $i] : ( multiply(inverse(X),X) = identity )
| ( multiply(inverse(a),a) = identity ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
multiply(inverse(a),a) = identity,
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
^ [X: $i] :
refl(( ( greatest_lower_bound(X,X) = X )
<=> ( greatest_lower_bound(X,X) = X ) )),
inference(bind,[status(th)],[]) ).
tff(11,plain,
( ! [X: $i] : ( greatest_lower_bound(X,X) = X )
<=> ! [X: $i] : ( greatest_lower_bound(X,X) = X ) ),
inference(quant_intro,[status(thm)],[10]) ).
tff(12,plain,
( ! [X: $i] : ( greatest_lower_bound(X,X) = X )
<=> ! [X: $i] : ( greatest_lower_bound(X,X) = X ) ),
inference(rewrite,[status(thm)],[]) ).
tff(13,axiom,
! [X: $i] : ( greatest_lower_bound(X,X) = X ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).
tff(14,plain,
! [X: $i] : ( greatest_lower_bound(X,X) = X ),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [X: $i] : ( greatest_lower_bound(X,X) = X ),
inference(skolemize,[status(sab)],[14]) ).
tff(16,plain,
! [X: $i] : ( greatest_lower_bound(X,X) = X ),
inference(modus_ponens,[status(thm)],[15,11]) ).
tff(17,plain,
( ~ ! [X: $i] : ( greatest_lower_bound(X,X) = X )
| ( greatest_lower_bound(b,b) = b ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(18,plain,
greatest_lower_bound(b,b) = b,
inference(unit_resolution,[status(thm)],[17,16]) ).
tff(19,plain,
b = greatest_lower_bound(b,b),
inference(symmetry,[status(thm)],[18]) ).
tff(20,plain,
multiply(b,a) = multiply(greatest_lower_bound(b,b),a),
inference(monotonicity,[status(thm)],[19]) ).
tff(21,plain,
multiply(greatest_lower_bound(b,b),a) = multiply(b,a),
inference(symmetry,[status(thm)],[20]) ).
tff(22,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(( ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) )
<=> ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ) )),
inference(bind,[status(th)],[]) ).
tff(23,plain,
( ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) )
<=> ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ) ),
inference(quant_intro,[status(thm)],[22]) ).
tff(24,plain,
( ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) )
<=> ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(25,axiom,
! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
tff(26,plain,
! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
inference(skolemize,[status(sab)],[26]) ).
tff(28,plain,
! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ),
inference(modus_ponens,[status(thm)],[27,23]) ).
tff(29,plain,
( ~ ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) )
| ( multiply(greatest_lower_bound(b,b),a) = greatest_lower_bound(multiply(b,a),multiply(b,a)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(30,plain,
multiply(greatest_lower_bound(b,b),a) = greatest_lower_bound(multiply(b,a),multiply(b,a)),
inference(unit_resolution,[status(thm)],[29,28]) ).
tff(31,plain,
greatest_lower_bound(multiply(b,a),multiply(b,a)) = multiply(greatest_lower_bound(b,b),a),
inference(symmetry,[status(thm)],[30]) ).
tff(32,plain,
greatest_lower_bound(multiply(b,a),multiply(b,a)) = multiply(b,a),
inference(transitivity,[status(thm)],[31,21]) ).
tff(33,plain,
^ [X: $i] :
refl(( ( multiply(identity,X) = X )
<=> ( multiply(identity,X) = X ) )),
inference(bind,[status(th)],[]) ).
tff(34,plain,
( ! [X: $i] : ( multiply(identity,X) = X )
<=> ! [X: $i] : ( multiply(identity,X) = X ) ),
inference(quant_intro,[status(thm)],[33]) ).
tff(35,plain,
( ! [X: $i] : ( multiply(identity,X) = X )
<=> ! [X: $i] : ( multiply(identity,X) = X ) ),
inference(rewrite,[status(thm)],[]) ).
tff(36,axiom,
! [X: $i] : ( multiply(identity,X) = X ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
tff(37,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(skolemize,[status(sab)],[37]) ).
tff(39,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(modus_ponens,[status(thm)],[38,34]) ).
tff(40,plain,
( ~ ! [X: $i] : ( multiply(identity,X) = X )
| ( multiply(identity,a) = a ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(41,plain,
multiply(identity,a) = a,
inference(unit_resolution,[status(thm)],[40,39]) ).
tff(42,plain,
a = multiply(identity,a),
inference(symmetry,[status(thm)],[41]) ).
tff(43,plain,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a))) = greatest_lower_bound(multiply(identity,a),multiply(b,a)),
inference(monotonicity,[status(thm)],[42,32]) ).
tff(44,plain,
greatest_lower_bound(multiply(identity,a),multiply(b,a)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a))),
inference(symmetry,[status(thm)],[43]) ).
tff(45,plain,
( ~ ! [Z: $i,Y: $i,X: $i] : ( multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) )
| ( multiply(greatest_lower_bound(identity,b),a) = greatest_lower_bound(multiply(identity,a),multiply(b,a)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(46,plain,
multiply(greatest_lower_bound(identity,b),a) = greatest_lower_bound(multiply(identity,a),multiply(b,a)),
inference(unit_resolution,[status(thm)],[45,28]) ).
tff(47,plain,
( ( greatest_lower_bound(identity,b) = identity )
<=> ( greatest_lower_bound(identity,b) = identity ) ),
inference(rewrite,[status(thm)],[]) ).
tff(48,axiom,
greatest_lower_bound(identity,b) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p06b_1) ).
tff(49,plain,
greatest_lower_bound(identity,b) = identity,
inference(modus_ponens,[status(thm)],[48,47]) ).
tff(50,plain,
multiply(greatest_lower_bound(identity,b),a) = multiply(identity,a),
inference(monotonicity,[status(thm)],[49]) ).
tff(51,plain,
multiply(identity,a) = multiply(greatest_lower_bound(identity,b),a),
inference(symmetry,[status(thm)],[50]) ).
tff(52,plain,
a = greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a))),
inference(transitivity,[status(thm)],[42,51,46,44]) ).
tff(53,plain,
multiply(inverse(a),a) = multiply(inverse(a),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a)))),
inference(monotonicity,[status(thm)],[52]) ).
tff(54,plain,
multiply(inverse(a),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a)))) = multiply(inverse(a),a),
inference(symmetry,[status(thm)],[53]) ).
tff(55,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(56,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)],[55]) ).
tff(57,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(58,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(59,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)],[58,57]) ).
tff(60,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)],[59]) ).
tff(61,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)],[60,56]) ).
tff(62,plain,
( ~ ! [Z: $i,Y: $i,X: $i] : ( multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) )
| ( multiply(inverse(a),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a)))) = greatest_lower_bound(multiply(inverse(a),a),multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a)))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(63,plain,
multiply(inverse(a),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a)))) = greatest_lower_bound(multiply(inverse(a),a),multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a)))),
inference(unit_resolution,[status(thm)],[62,61]) ).
tff(64,plain,
greatest_lower_bound(multiply(inverse(a),a),multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a)))) = multiply(inverse(a),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),multiply(b,a)))),
inference(symmetry,[status(thm)],[63]) ).
tff(65,plain,
multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a))) = multiply(inverse(a),multiply(b,a)),
inference(monotonicity,[status(thm)],[32]) ).
tff(66,plain,
greatest_lower_bound(multiply(inverse(a),a),multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a)))) = greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
inference(monotonicity,[status(thm)],[9,65]) ).
tff(67,plain,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) = greatest_lower_bound(multiply(inverse(a),a),multiply(inverse(a),greatest_lower_bound(multiply(b,a),multiply(b,a)))),
inference(symmetry,[status(thm)],[66]) ).
tff(68,plain,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) = identity,
inference(transitivity,[status(thm)],[67,64,54,9]) ).
tff(69,plain,
( ( greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity )
<=> ( greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity ) ),
inference(rewrite,[status(thm)],[]) ).
tff(70,axiom,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p06b) ).
tff(71,plain,
greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) != identity,
inference(modus_ponens,[status(thm)],[70,69]) ).
tff(72,plain,
$false,
inference(unit_resolution,[status(thm)],[71,68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP175-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n003.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 : Thu Jun 19 15:45:09 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Proof
% See solution above
% 0.20/0.40 % E exiting
%------------------------------------------------------------------------------