TSTP Solution File: GRP041-2 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : GRP041-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n025.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:38 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 17
% Syntax : Number of formulae : 33 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 114 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 155 ( 73 ~; 69 |; 0 &)
% ( 13 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 94 ( 85 !; 0 ?; 94 :)
% Comments :
%------------------------------------------------------------------------------
tff(product_type,type,
product: ( $i * $i * $i ) > $o ).
tff(a_type,type,
a: $i ).
tff(identity_type,type,
identity: $i ).
tff(equalish_type,type,
equalish: ( $i * $i ) > $o ).
tff(1,plain,
^ [X: $i] :
refl(
( product(identity,X,X)
<=> product(identity,X,X) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] : product(identity,X,X)
<=> ! [X: $i] : product(identity,X,X) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] : product(identity,X,X)
<=> ! [X: $i] : product(identity,X,X) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [X: $i] : product(identity,X,X),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',left_identity) ).
tff(5,plain,
! [X: $i] : product(identity,X,X),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [X: $i] : product(identity,X,X),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [X: $i] : product(identity,X,X),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [X: $i] : product(identity,X,X)
| product(identity,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
product(identity,a,a),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
( ~ equalish(a,a)
<=> ~ equalish(a,a) ),
inference(rewrite,[status(thm)],]) ).
tff(11,axiom,
~ equalish(a,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_reflexivity) ).
tff(12,plain,
~ equalish(a,a),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
^ [W: $i,Z: $i,Y: $i,X: $i] :
refl(
( ( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
<=> ( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ) )),
inference(bind,[status(th)],]) ).
tff(14,plain,
( ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
<=> ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ) ),
inference(quant_intro,[status(thm)],[13]) ).
tff(15,plain,
( ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
<=> ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
^ [W: $i,Z: $i,Y: $i,X: $i] :
rewrite(
( ( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) )
<=> ( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ) )),
inference(bind,[status(th)],]) ).
tff(17,plain,
( ! [W: $i,Z: $i,Y: $i,X: $i] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) )
<=> ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ) ),
inference(quant_intro,[status(thm)],[16]) ).
tff(18,axiom,
! [W: $i,Z: $i,Y: $i,X: $i] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',total_function2) ).
tff(19,plain,
! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(modus_ponens,[status(thm)],[19,15]) ).
tff(21,plain,
! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(skolemize,[status(sab)],[20]) ).
tff(22,plain,
! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) ),
inference(modus_ponens,[status(thm)],[21,14]) ).
tff(23,plain,
( ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a) )
<=> ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
( ( equalish(a,a)
| ~ product(identity,a,a)
| ~ product(identity,a,a) )
<=> ( equalish(a,a)
| ~ product(identity,a,a) ) ),
inference(rewrite,[status(thm)],]) ).
tff(25,plain,
( ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a)
| ~ product(identity,a,a) )
<=> ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a) ) ),
inference(monotonicity,[status(thm)],[24]) ).
tff(26,plain,
( ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a)
| ~ product(identity,a,a) )
<=> ( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a) ) ),
inference(transitivity,[status(thm)],[25,23]) ).
tff(27,plain,
( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a)
| ~ product(identity,a,a) ),
inference(quant_inst,[status(thm)],]) ).
tff(28,plain,
( ~ ! [W: $i,Z: $i,Y: $i,X: $i] :
( equalish(Z,W)
| ~ product(X,Y,W)
| ~ product(X,Y,Z) )
| equalish(a,a)
| ~ product(identity,a,a) ),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
$false,
inference(unit_resolution,[status(thm)],[28,22,12,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP041-2 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 31 14:27:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.35 Usage: tptp [options] [-file:]file
% 0.13/0.35 -h, -? prints this message.
% 0.13/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.35 -m, -model generate model.
% 0.13/0.35 -p, -proof generate proof.
% 0.13/0.35 -c, -core generate unsat core of named formulas.
% 0.13/0.35 -st, -statistics display statistics.
% 0.13/0.35 -t:timeout set timeout (in second).
% 0.13/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.35 -<param>:<value> configuration parameter and value.
% 0.13/0.35 -o:<output-file> file to place output in.
% 0.21/0.39 % SZS status Unsatisfiable
% 0.21/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------