%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : GRP170-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n001.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.19s 0.38s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 30
% Syntax : Number of formulae : 85 ( 64 unt; 0 typ; 0 def)
% Number of atoms : 118 ( 111 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 37 ( 10 ~; 6 |; 0 &)
% ( 21 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 6 ( 6 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 : 150 ( 135 !; 0 ?; 150 :)
% Comments :
%------------------------------------------------------------------------------
tff(multiply_type,type,
multiply: ( $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(c_type,type,
c: $i ).
tff(a_type,type,
a: $i ).
tff(greatest_lower_bound_type,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(1,plain,
( ( least_upper_bound(a,b) = b )
<=> ( least_upper_bound(a,b) = b ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03d_1) ).
tff(3,plain,
least_upper_bound(a,b) = b,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
b = least_upper_bound(a,b),
inference(symmetry,[status(thm)],[3]) ).
tff(5,plain,
multiply(b,d) = multiply(least_upper_bound(a,b),d),
inference(monotonicity,[status(thm)],[4]) ).
tff(6,plain,
multiply(least_upper_bound(a,b),d) = multiply(b,d),
inference(symmetry,[status(thm)],[5]) ).
tff(7,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(8,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)],[7]) ).
tff(9,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(10,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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_lub2) ).
tff(11,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)],[10,9]) ).
tff(12,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)],[11]) ).
tff(13,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)],[12,8]) ).
tff(14,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(15,plain,
multiply(least_upper_bound(a,b),d) = least_upper_bound(multiply(a,d),multiply(b,d)),
inference(unit_resolution,[status(thm)],[14,13]) ).
tff(16,plain,
least_upper_bound(multiply(a,d),multiply(b,d)) = multiply(least_upper_bound(a,b),d),
inference(symmetry,[status(thm)],[15]) ).
tff(17,plain,
multiply(b,d) = least_upper_bound(multiply(a,d),multiply(b,d)),
inference(transitivity,[status(thm)],[5,15]) ).
tff(18,plain,
^ [Y: $i,X: $i] :
refl(( ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
<=> ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ) )),
inference(bind,[status(th)],[]) ).
tff(19,plain,
( ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
<=> ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
<=> ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,axiom,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
tff(22,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(skolemize,[status(sab)],[22]) ).
tff(24,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[23,19]) ).
tff(25,plain,
( ~ ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
| ( least_upper_bound(multiply(a,c),multiply(a,d)) = least_upper_bound(multiply(a,d),multiply(a,c)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(26,plain,
least_upper_bound(multiply(a,c),multiply(a,d)) = least_upper_bound(multiply(a,d),multiply(a,c)),
inference(unit_resolution,[status(thm)],[25,24]) ).
tff(27,plain,
least_upper_bound(multiply(a,d),multiply(a,c)) = least_upper_bound(multiply(a,c),multiply(a,d)),
inference(symmetry,[status(thm)],[26]) ).
tff(28,plain,
^ [Y: $i,X: $i] :
refl(( ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) )
<=> ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ) )),
inference(bind,[status(th)],[]) ).
tff(29,plain,
( ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) )
<=> ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ) ),
inference(quant_intro,[status(thm)],[28]) ).
tff(30,plain,
( ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) )
<=> ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(31,axiom,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
tff(32,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[31,30]) ).
tff(33,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(skolemize,[status(sab)],[32]) ).
tff(34,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[33,29]) ).
tff(35,plain,
( ~ ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) )
| ( greatest_lower_bound(multiply(a,c),multiply(a,d)) = greatest_lower_bound(multiply(a,d),multiply(a,c)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(36,plain,
greatest_lower_bound(multiply(a,c),multiply(a,d)) = greatest_lower_bound(multiply(a,d),multiply(a,c)),
inference(unit_resolution,[status(thm)],[35,34]) ).
tff(37,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(38,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)],[37]) ).
tff(39,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(40,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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb1) ).
tff(41,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)],[40,39]) ).
tff(42,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)],[41]) ).
tff(43,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)],[42,38]) ).
tff(44,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(45,plain,
multiply(a,greatest_lower_bound(c,d)) = greatest_lower_bound(multiply(a,c),multiply(a,d)),
inference(unit_resolution,[status(thm)],[44,43]) ).
tff(46,plain,
( ( greatest_lower_bound(c,d) = c )
<=> ( greatest_lower_bound(c,d) = c ) ),
inference(rewrite,[status(thm)],[]) ).
tff(47,axiom,
greatest_lower_bound(c,d) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p03d_2) ).
tff(48,plain,
greatest_lower_bound(c,d) = c,
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,plain,
multiply(a,greatest_lower_bound(c,d)) = multiply(a,c),
inference(monotonicity,[status(thm)],[48]) ).
tff(50,plain,
multiply(a,c) = multiply(a,greatest_lower_bound(c,d)),
inference(symmetry,[status(thm)],[49]) ).
tff(51,plain,
multiply(a,c) = greatest_lower_bound(multiply(a,d),multiply(a,c)),
inference(transitivity,[status(thm)],[50,45,36]) ).
tff(52,plain,
least_upper_bound(multiply(a,d),multiply(a,c)) = least_upper_bound(multiply(a,d),greatest_lower_bound(multiply(a,d),multiply(a,c))),
inference(monotonicity,[status(thm)],[51]) ).
tff(53,plain,
least_upper_bound(multiply(a,d),greatest_lower_bound(multiply(a,d),multiply(a,c))) = least_upper_bound(multiply(a,d),multiply(a,c)),
inference(symmetry,[status(thm)],[52]) ).
tff(54,plain,
^ [Y: $i,X: $i] :
refl(( ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X )
<=> ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ) )),
inference(bind,[status(th)],[]) ).
tff(55,plain,
( ! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X )
<=> ! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ) ),
inference(quant_intro,[status(thm)],[54]) ).
tff(56,plain,
( ! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X )
<=> ! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ) ),
inference(rewrite,[status(thm)],[]) ).
tff(57,axiom,
! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
tff(58,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
inference(modus_ponens,[status(thm)],[57,56]) ).
tff(59,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
inference(skolemize,[status(sab)],[58]) ).
tff(60,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X ),
inference(modus_ponens,[status(thm)],[59,55]) ).
tff(61,plain,
( ~ ! [Y: $i,X: $i] : ( least_upper_bound(X,greatest_lower_bound(X,Y)) = X )
| ( least_upper_bound(multiply(a,d),greatest_lower_bound(multiply(a,d),multiply(a,c))) = multiply(a,d) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(62,plain,
least_upper_bound(multiply(a,d),greatest_lower_bound(multiply(a,d),multiply(a,c))) = multiply(a,d),
inference(unit_resolution,[status(thm)],[61,60]) ).
tff(63,plain,
multiply(a,d) = least_upper_bound(multiply(a,d),greatest_lower_bound(multiply(a,d),multiply(a,c))),
inference(symmetry,[status(thm)],[62]) ).
tff(64,plain,
multiply(a,d) = least_upper_bound(multiply(a,c),multiply(a,d)),
inference(transitivity,[status(thm)],[63,53,27]) ).
tff(65,plain,
least_upper_bound(multiply(a,d),multiply(b,d)) = least_upper_bound(least_upper_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))),
inference(monotonicity,[status(thm)],[64,17]) ).
tff(66,plain,
least_upper_bound(least_upper_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))) = least_upper_bound(multiply(a,d),multiply(b,d)),
inference(symmetry,[status(thm)],[65]) ).
tff(67,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(( ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) )
<=> ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ) )),
inference(bind,[status(th)],[]) ).
tff(68,plain,
( ! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) )
<=> ! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ) ),
inference(quant_intro,[status(thm)],[67]) ).
tff(69,plain,
( ! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) )
<=> ! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(70,axiom,
! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
tff(71,plain,
! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
inference(modus_ponens,[status(thm)],[70,69]) ).
tff(72,plain,
! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
inference(skolemize,[status(sab)],[71]) ).
tff(73,plain,
! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ),
inference(modus_ponens,[status(thm)],[72,68]) ).
tff(74,plain,
( ~ ! [Z: $i,Y: $i,X: $i] : ( least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) )
| ( least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = least_upper_bound(least_upper_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(75,plain,
least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = least_upper_bound(least_upper_bound(multiply(a,c),multiply(a,d)),least_upper_bound(multiply(a,d),multiply(b,d))),
inference(unit_resolution,[status(thm)],[74,73]) ).
tff(76,plain,
least_upper_bound(multiply(a,d),multiply(b,d)) = multiply(b,d),
inference(transitivity,[status(thm)],[16,6]) ).
tff(77,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)],[76]) ).
tff(78,plain,
least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d))) = multiply(b,d),
inference(transitivity,[status(thm)],[77,16,6]) ).
tff(79,plain,
least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))) = least_upper_bound(multiply(a,c),multiply(b,d)),
inference(monotonicity,[status(thm)],[78]) ).
tff(80,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = least_upper_bound(multiply(a,c),least_upper_bound(multiply(a,d),least_upper_bound(multiply(a,d),multiply(b,d)))),
inference(symmetry,[status(thm)],[79]) ).
tff(81,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d),
inference(transitivity,[status(thm)],[80,75,66,16,6]) ).
tff(82,plain,
( ( least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d) )
<=> ( least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(83,axiom,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p03d) ).
tff(84,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
inference(modus_ponens,[status(thm)],[83,82]) ).
tff(85,plain,
$false,
inference(unit_resolution,[status(thm)],[84,81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP170-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n001.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:48:49 EDT 2025
% 0.19/0.33 % CPUTime :
% 0.19/0.38 % SZS status Unsatisfiable
% 0.19/0.38 % SZS output start Proof
% See solution above
% 0.19/0.39 % E exiting
%------------------------------------------------------------------------------