%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : GRP156-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n015.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:17 AM UTC 2025
% Result : Unsatisfiable 0.19s 0.38s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 35 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 44 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 : 50 ( 45 !; 0 ?; 50 :)
% 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(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(multiply(a,c),least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c)))) = multiply(a,c) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
greatest_lower_bound(multiply(a,c),least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c)))) = multiply(a,c),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ( least_upper_bound(a,b) = b )
<=> ( least_upper_bound(a,b) = b ) ),
inference(rewrite,[status(thm)],[]) ).
tff(11,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono1c_1) ).
tff(12,plain,
least_upper_bound(a,b) = b,
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
b = least_upper_bound(a,b),
inference(symmetry,[status(thm)],[12]) ).
tff(14,plain,
multiply(b,c) = multiply(least_upper_bound(a,b),c),
inference(monotonicity,[status(thm)],[13]) ).
tff(15,plain,
multiply(least_upper_bound(a,b),c) = multiply(b,c),
inference(symmetry,[status(thm)],[14]) ).
tff(16,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(17,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)],[16]) ).
tff(18,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(19,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(20,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)],[19,18]) ).
tff(21,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)],[20]) ).
tff(22,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)],[21,17]) ).
tff(23,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),c) = least_upper_bound(multiply(a,c),multiply(b,c)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(24,plain,
multiply(least_upper_bound(a,b),c) = least_upper_bound(multiply(a,c),multiply(b,c)),
inference(unit_resolution,[status(thm)],[23,22]) ).
tff(25,plain,
least_upper_bound(multiply(a,c),multiply(b,c)) = multiply(least_upper_bound(a,b),c),
inference(symmetry,[status(thm)],[24]) ).
tff(26,plain,
least_upper_bound(multiply(a,c),multiply(b,c)) = multiply(b,c),
inference(transitivity,[status(thm)],[25,15]) ).
tff(27,plain,
least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c))) = least_upper_bound(multiply(a,c),multiply(b,c)),
inference(monotonicity,[status(thm)],[26]) ).
tff(28,plain,
least_upper_bound(multiply(a,c),multiply(b,c)) = least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c))),
inference(symmetry,[status(thm)],[27]) ).
tff(29,plain,
multiply(b,c) = least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c))),
inference(transitivity,[status(thm)],[14,24,28]) ).
tff(30,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) = greatest_lower_bound(multiply(a,c),least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,c),multiply(b,c)))),
inference(monotonicity,[status(thm)],[29]) ).
tff(31,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c),
inference(transitivity,[status(thm)],[30,9]) ).
tff(32,plain,
( ( greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c) )
<=> ( greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(33,axiom,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono1c) ).
tff(34,plain,
greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
$false,
inference(unit_resolution,[status(thm)],[34,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP156-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n015.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:44:41 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.19/0.38 % SZS status Unsatisfiable
% 0.19/0.38 % SZS output start Proof
% See solution above
% 0.19/0.38 % E exiting
%------------------------------------------------------------------------------