%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : GRP168-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n012.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:19 AM UTC 2025
% Result : Unsatisfiable 0.11s 0.37s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 47 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 16 ( 6 ~; 2 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 2 ( 2 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 : 60 ( 54 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
tff(multiply_type,type,
multiply: ( $i * $i ) > $i ).
tff(c_type,type,
c: $i ).
tff(a_type,type,
a: $i ).
tff(inverse_type,type,
inverse: $i > $i ).
tff(greatest_lower_bound_type,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(b_type,type,
b: $i ).
tff(1,plain,
( ( greatest_lower_bound(a,b) = a )
<=> ( greatest_lower_bound(a,b) = a ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p01b_1) ).
tff(3,plain,
greatest_lower_bound(a,b) = a,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
a = greatest_lower_bound(a,b),
inference(symmetry,[status(thm)],[3]) ).
tff(5,plain,
multiply(a,c) = multiply(greatest_lower_bound(a,b),c),
inference(monotonicity,[status(thm)],[4]) ).
tff(6,plain,
multiply(greatest_lower_bound(a,b),c) = multiply(a,c),
inference(symmetry,[status(thm)],[5]) ).
tff(7,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(8,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)],[7]) ).
tff(9,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(10,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(11,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)],[10,9]) ).
tff(12,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)],[11]) ).
tff(13,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)],[12,8]) ).
tff(14,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(a,b),c) = greatest_lower_bound(multiply(a,c),multiply(b,c)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(15,plain,
multiply(greatest_lower_bound(a,b),c) = greatest_lower_bound(multiply(a,c),multiply(b,c)),
inference(unit_resolution,[status(thm)],[14,13]) ).
tff(16,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(greatest_lower_bound(a,b),c),
inference(symmetry,[status(thm)],[15]) ).
tff(17,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c),
inference(transitivity,[status(thm)],[16,6]) ).
tff(18,plain,
greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c)) = greatest_lower_bound(multiply(a,c),multiply(b,c)),
inference(monotonicity,[status(thm)],[17]) ).
tff(19,plain,
greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c)) = multiply(a,c),
inference(transitivity,[status(thm)],[18,16,6]) ).
tff(20,plain,
multiply(inverse(c),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c))) = multiply(inverse(c),multiply(a,c)),
inference(monotonicity,[status(thm)],[19]) ).
tff(21,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(22,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)],[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)) )
<=> ! [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(24,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(25,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)],[24,23]) ).
tff(26,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)],[25]) ).
tff(27,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)],[26,22]) ).
tff(28,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(c),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))),multiply(inverse(c),multiply(b,c))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(29,plain,
multiply(inverse(c),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))),multiply(inverse(c),multiply(b,c))),
inference(unit_resolution,[status(thm)],[28,27]) ).
tff(30,plain,
greatest_lower_bound(multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(b,c))),
inference(symmetry,[status(thm)],[29]) ).
tff(31,plain,
multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))) = multiply(inverse(c),multiply(a,c)),
inference(monotonicity,[status(thm)],[17]) ).
tff(32,plain,
multiply(inverse(c),multiply(a,c)) = multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))),
inference(symmetry,[status(thm)],[31]) ).
tff(33,plain,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))),multiply(inverse(c),multiply(b,c))),
inference(monotonicity,[status(thm)],[32]) ).
tff(34,plain,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(a,c)),
inference(transitivity,[status(thm)],[33,30,20]) ).
tff(35,plain,
( ( greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)) )
<=> ( greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(36,axiom,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p01b) ).
tff(37,plain,
greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) != multiply(inverse(c),multiply(a,c)),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
$false,
inference(unit_resolution,[status(thm)],[37,34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP168-2 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n012.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:43:56 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.11/0.37 % SZS status Unsatisfiable
% 0.11/0.37 % SZS output start Proof
% See solution above
% 0.11/0.38 % E exiting
%------------------------------------------------------------------------------