TSTP Solution File: GRP173-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n024.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 : Fri Sep 16 22:26:32 EDT 2022
% Result : Unsatisfiable 0.13s 0.40s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 38
% Syntax : Number of formulae : 90 ( 61 unt; 6 typ; 0 def)
% Number of atoms : 119 ( 112 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 41 ( 12 ~; 8 |; 0 &)
% ( 21 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 6 ( 6 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 114 ( 103 !; 0 ?; 114 :)
% Comments :
%------------------------------------------------------------------------------
tff(a_type,type,
a: $i ).
tff(identity_type,type,
identity: $i ).
tff(greatest_lower_bound_type,type,
greatest_lower_bound: ( $i * $i ) > $i ).
tff(least_upper_bound_type,type,
least_upper_bound: ( $i * $i ) > $i ).
tff(multiply_type,type,
multiply: ( $i * $i ) > $i ).
tff(inverse_type,type,
inverse: $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/sandbox2/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(a,least_upper_bound(a,identity)) = a ) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
greatest_lower_bound(a,least_upper_bound(a,identity)) = a,
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ( least_upper_bound(identity,a) = identity )
<=> ( least_upper_bound(identity,a) = identity ) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
least_upper_bound(identity,a) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p05a_1) ).
tff(12,plain,
least_upper_bound(identity,a) = identity,
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,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(14,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)],[13]) ).
tff(15,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(16,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(17,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(skolemize,[status(sab)],[17]) ).
tff(19,plain,
! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[18,14]) ).
tff(20,plain,
( ~ ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
| ( least_upper_bound(identity,a) = least_upper_bound(a,identity) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(21,plain,
least_upper_bound(identity,a) = least_upper_bound(a,identity),
inference(unit_resolution,[status(thm)],[20,19]) ).
tff(22,plain,
least_upper_bound(a,identity) = least_upper_bound(identity,a),
inference(symmetry,[status(thm)],[21]) ).
tff(23,plain,
least_upper_bound(a,identity) = identity,
inference(transitivity,[status(thm)],[22,12]) ).
tff(24,plain,
greatest_lower_bound(a,least_upper_bound(a,identity)) = greatest_lower_bound(a,identity),
inference(monotonicity,[status(thm)],[23]) ).
tff(25,plain,
greatest_lower_bound(a,identity) = greatest_lower_bound(a,least_upper_bound(a,identity)),
inference(symmetry,[status(thm)],[24]) ).
tff(26,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(27,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)],[26]) ).
tff(28,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(29,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(30,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(skolemize,[status(sab)],[30]) ).
tff(32,plain,
! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ),
inference(modus_ponens,[status(thm)],[31,27]) ).
tff(33,plain,
( ~ ! [Y: $i,X: $i] : ( greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) )
| ( greatest_lower_bound(a,identity) = greatest_lower_bound(identity,a) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(34,plain,
greatest_lower_bound(a,identity) = greatest_lower_bound(identity,a),
inference(unit_resolution,[status(thm)],[33,32]) ).
tff(35,plain,
greatest_lower_bound(identity,a) = greatest_lower_bound(a,identity),
inference(symmetry,[status(thm)],[34]) ).
tff(36,plain,
^ [X: $i] :
refl(
( ( multiply(identity,X) = X )
<=> ( multiply(identity,X) = X ) )),
inference(bind,[status(th)],]) ).
tff(37,plain,
( ! [X: $i] : ( multiply(identity,X) = X )
<=> ! [X: $i] : ( multiply(identity,X) = X ) ),
inference(quant_intro,[status(thm)],[36]) ).
tff(38,plain,
( ! [X: $i] : ( multiply(identity,X) = X )
<=> ! [X: $i] : ( multiply(identity,X) = X ) ),
inference(rewrite,[status(thm)],]) ).
tff(39,axiom,
! [X: $i] : ( multiply(identity,X) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
tff(40,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(skolemize,[status(sab)],[40]) ).
tff(42,plain,
! [X: $i] : ( multiply(identity,X) = X ),
inference(modus_ponens,[status(thm)],[41,37]) ).
tff(43,plain,
( ~ ! [X: $i] : ( multiply(identity,X) = X )
| ( multiply(identity,a) = a ) ),
inference(quant_inst,[status(thm)],]) ).
tff(44,plain,
multiply(identity,a) = a,
inference(unit_resolution,[status(thm)],[43,42]) ).
tff(45,plain,
a = multiply(identity,a),
inference(symmetry,[status(thm)],[44]) ).
tff(46,plain,
^ [X: $i] :
refl(
( ( multiply(inverse(X),X) = identity )
<=> ( multiply(inverse(X),X) = identity ) )),
inference(bind,[status(th)],]) ).
tff(47,plain,
( ! [X: $i] : ( multiply(inverse(X),X) = identity )
<=> ! [X: $i] : ( multiply(inverse(X),X) = identity ) ),
inference(quant_intro,[status(thm)],[46]) ).
tff(48,plain,
( ! [X: $i] : ( multiply(inverse(X),X) = identity )
<=> ! [X: $i] : ( multiply(inverse(X),X) = identity ) ),
inference(rewrite,[status(thm)],]) ).
tff(49,axiom,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
tff(50,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(modus_ponens,[status(thm)],[49,48]) ).
tff(51,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(skolemize,[status(sab)],[50]) ).
tff(52,plain,
! [X: $i] : ( multiply(inverse(X),X) = identity ),
inference(modus_ponens,[status(thm)],[51,47]) ).
tff(53,plain,
( ~ ! [X: $i] : ( multiply(inverse(X),X) = identity )
| ( multiply(inverse(a),a) = identity ) ),
inference(quant_inst,[status(thm)],]) ).
tff(54,plain,
multiply(inverse(a),a) = identity,
inference(unit_resolution,[status(thm)],[53,52]) ).
tff(55,plain,
identity = multiply(inverse(a),a),
inference(symmetry,[status(thm)],[54]) ).
tff(56,plain,
greatest_lower_bound(identity,a) = greatest_lower_bound(multiply(inverse(a),a),multiply(identity,a)),
inference(monotonicity,[status(thm)],[55,45]) ).
tff(57,plain,
greatest_lower_bound(multiply(inverse(a),a),multiply(identity,a)) = greatest_lower_bound(identity,a),
inference(symmetry,[status(thm)],[56]) ).
tff(58,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(59,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)],[58]) ).
tff(60,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(61,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/sandbox2/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
tff(62,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)],[61,60]) ).
tff(63,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)],[62]) ).
tff(64,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)],[63,59]) ).
tff(65,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(inverse(a),identity),a) = greatest_lower_bound(multiply(inverse(a),a),multiply(identity,a)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(66,plain,
multiply(greatest_lower_bound(inverse(a),identity),a) = greatest_lower_bound(multiply(inverse(a),a),multiply(identity,a)),
inference(unit_resolution,[status(thm)],[65,64]) ).
tff(67,plain,
( ~ ! [Y: $i,X: $i] : ( greatest_lower_bound(X,least_upper_bound(X,Y)) = X )
| ( greatest_lower_bound(inverse(a),least_upper_bound(inverse(a),identity)) = inverse(a) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(68,plain,
greatest_lower_bound(inverse(a),least_upper_bound(inverse(a),identity)) = inverse(a),
inference(unit_resolution,[status(thm)],[67,7]) ).
tff(69,plain,
( ~ ! [Y: $i,X: $i] : ( least_upper_bound(X,Y) = least_upper_bound(Y,X) )
| ( least_upper_bound(identity,inverse(a)) = least_upper_bound(inverse(a),identity) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(70,plain,
least_upper_bound(identity,inverse(a)) = least_upper_bound(inverse(a),identity),
inference(unit_resolution,[status(thm)],[69,19]) ).
tff(71,plain,
( ( least_upper_bound(identity,inverse(a)) = identity )
<=> ( least_upper_bound(identity,inverse(a)) = identity ) ),
inference(rewrite,[status(thm)],]) ).
tff(72,axiom,
least_upper_bound(identity,inverse(a)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p05a_2) ).
tff(73,plain,
least_upper_bound(identity,inverse(a)) = identity,
inference(modus_ponens,[status(thm)],[72,71]) ).
tff(74,plain,
identity = least_upper_bound(identity,inverse(a)),
inference(symmetry,[status(thm)],[73]) ).
tff(75,plain,
identity = least_upper_bound(inverse(a),identity),
inference(transitivity,[status(thm)],[74,70]) ).
tff(76,plain,
greatest_lower_bound(inverse(a),identity) = greatest_lower_bound(inverse(a),least_upper_bound(inverse(a),identity)),
inference(monotonicity,[status(thm)],[75]) ).
tff(77,plain,
greatest_lower_bound(inverse(a),identity) = inverse(a),
inference(transitivity,[status(thm)],[76,68]) ).
tff(78,plain,
multiply(greatest_lower_bound(inverse(a),identity),a) = multiply(inverse(a),a),
inference(monotonicity,[status(thm)],[77]) ).
tff(79,plain,
multiply(inverse(a),a) = multiply(greatest_lower_bound(inverse(a),identity),a),
inference(symmetry,[status(thm)],[78]) ).
tff(80,plain,
identity = a,
inference(transitivity,[status(thm)],[55,79,66,57,35,25,9]) ).
tff(81,plain,
( ( identity != a )
<=> ( identity != a ) ),
inference(rewrite,[status(thm)],]) ).
tff(82,axiom,
identity != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p05a) ).
tff(83,plain,
identity != a,
inference(modus_ponens,[status(thm)],[82,81]) ).
tff(84,plain,
$false,
inference(unit_resolution,[status(thm)],[83,80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Aug 31 15:25:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.13/0.40 % SZS status Unsatisfiable
% 0.13/0.40 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------