TSTP Solution File: GRP005-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : GRP005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n019.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:25:23 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 37 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 176 ( 0 equ)
% Maximal formula atoms : 15 ( 5 avg)
% Number of connectives : 259 ( 124 ~; 118 |; 0 &)
% ( 17 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 9 ( 9 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 73 ( 66 !; 0 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
tff(product_type,type,
product: ( $i * $i * $i ) > $o ).
tff(identity_type,type,
identity: $i ).
tff(inverse_type,type,
inverse: $i > $i ).
tff(a_type,type,
a: $i ).
tff(an_element_type,type,
an_element: $i > $o ).
tff(1,plain,
^ [X: $i] :
refl(
( product(X,inverse(X),identity)
<=> product(X,inverse(X),identity) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] : product(X,inverse(X),identity)
<=> ! [X: $i] : product(X,inverse(X),identity) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : product(X,inverse(X),identity)
<=> ! [X: $i] : product(X,inverse(X),identity) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [X: $i] : product(X,inverse(X),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
tff(5,plain,
! [X: $i] : product(X,inverse(X),identity),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : product(X,inverse(X),identity),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : product(X,inverse(X),identity),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [X: $i] : product(X,inverse(X),identity)
| product(a,inverse(a),identity) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
product(a,inverse(a),identity),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ~ an_element(identity)
<=> ~ an_element(identity) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
~ an_element(identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_identity_is_an_element) ).
tff(12,plain,
~ an_element(identity),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(
( ( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
<=> ( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) )),
inference(bind,[status(th)],]) ).
tff(14,plain,
( ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
<=> ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
<=> ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
^ [Z: $i,Y: $i,X: $i] :
trans(
monotonicity(
rewrite(
( ( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z) )
<=> ( ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) )),
( ( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) )
<=> ( ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X)
| an_element(Z) ) )),
rewrite(
( ( ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X)
| an_element(Z) )
<=> ( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) )),
( ( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) )
<=> ( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) )),
inference(bind,[status(th)],]) ).
tff(17,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) )
<=> ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,axiom,
! [Z: $i,Y: $i,X: $i] :
( ~ an_element(X)
| ~ an_element(Y)
| ~ product(X,inverse(Y),Z)
| an_element(Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).
tff(19,plain,
! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ),
inference(modus_ponens,[status(thm)],[19,15]) ).
tff(21,plain,
! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ),
inference(skolemize,[status(sab)],[20]) ).
tff(22,plain,
! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) ),
inference(modus_ponens,[status(thm)],[21,14]) ).
tff(23,plain,
( an_element(a)
<=> an_element(a) ),
inference(rewrite,[status(thm)],]) ).
tff(24,axiom,
an_element(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_of_set) ).
tff(25,plain,
an_element(a),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(27,plain,
( ( an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a)
| ~ an_element(a) )
<=> ( an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(28,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a)
| ~ an_element(a) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) ) ),
inference(monotonicity,[status(thm)],[27]) ).
tff(29,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a)
| ~ an_element(a) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) ) ),
inference(transitivity,[status(thm)],[28,26]) ).
tff(30,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a)
| ~ an_element(a) ),
inference(quant_inst,[status(thm)],]) ).
tff(31,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( an_element(Z)
| ~ product(X,inverse(Y),Z)
| ~ an_element(Y)
| ~ an_element(X) )
| an_element(identity)
| ~ product(a,inverse(a),identity)
| ~ an_element(a) ),
inference(modus_ponens,[status(thm)],[30,29]) ).
tff(32,plain,
$false,
inference(unit_resolution,[status(thm)],[31,25,22,12,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : GRP005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.33 % Computer : n019.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 : Wed Aug 31 14:06:05 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.33 Usage: tptp [options] [-file:]file
% 0.11/0.33 -h, -? prints this message.
% 0.11/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.11/0.33 -m, -model generate model.
% 0.11/0.33 -p, -proof generate proof.
% 0.11/0.33 -c, -core generate unsat core of named formulas.
% 0.11/0.33 -st, -statistics display statistics.
% 0.11/0.33 -t:timeout set timeout (in second).
% 0.11/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.11/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.33 -<param>:<value> configuration parameter and value.
% 0.11/0.33 -o:<output-file> file to place output in.
% 0.19/0.38 % SZS status Unsatisfiable
% 0.19/0.38 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------