TSTP Solution File: GRP702-11 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n018.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:29:31 EDT 2022
% Result : Unsatisfiable 0.21s 0.45s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 47 ( 31 unt; 6 typ; 0 def)
% Number of atoms : 57 ( 53 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 7 ~; 3 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 45 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
tff(mult_type,type,
mult: ( $i * $i ) > $i ).
tff(op_d_type,type,
op_d: $i ).
tff(x1_type,type,
x1: $i ).
tff(x0_type,type,
x0: $i ).
tff(op_c_type,type,
op_c: $i ).
tff(ld_type,type,
ld: ( $i * $i ) > $i ).
tff(1,plain,
^ [B: $i,A: $i] :
refl(
( ( ld(A,mult(A,B)) = B )
<=> ( ld(A,mult(A,B)) = B ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
<=> ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
<=> ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,axiom,
! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).
tff(5,plain,
! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [B: $i,A: $i] : ( ld(A,mult(A,B)) = B )
| ( ld(op_c,mult(op_c,op_c)) = op_c ) ),
inference(quant_inst,[status(thm)],]) ).
tff(9,plain,
ld(op_c,mult(op_c,op_c)) = op_c,
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
^ [A: $i] :
refl(
( ( op_d = ld(A,mult(op_c,A)) )
<=> ( op_d = ld(A,mult(op_c,A)) ) )),
inference(bind,[status(th)],]) ).
tff(11,plain,
( ! [A: $i] : ( op_d = ld(A,mult(op_c,A)) )
<=> ! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ) ),
inference(quant_intro,[status(thm)],[10]) ).
tff(12,plain,
( ! [A: $i] : ( op_d = ld(A,mult(op_c,A)) )
<=> ! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(13,axiom,
! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).
tff(14,plain,
! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ),
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ),
inference(skolemize,[status(sab)],[14]) ).
tff(16,plain,
! [A: $i] : ( op_d = ld(A,mult(op_c,A)) ),
inference(modus_ponens,[status(thm)],[15,11]) ).
tff(17,plain,
( ~ ! [A: $i] : ( op_d = ld(A,mult(op_c,A)) )
| ( op_d = ld(op_c,mult(op_c,op_c)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(18,plain,
op_d = ld(op_c,mult(op_c,op_c)),
inference(unit_resolution,[status(thm)],[17,16]) ).
tff(19,plain,
op_d = op_c,
inference(transitivity,[status(thm)],[18,9]) ).
tff(20,plain,
mult(mult(x0,x1),op_d) = mult(mult(x0,x1),op_c),
inference(monotonicity,[status(thm)],[19]) ).
tff(21,plain,
mult(mult(x0,x1),op_c) = mult(mult(x0,x1),op_d),
inference(symmetry,[status(thm)],[20]) ).
tff(22,plain,
^ [B: $i,A: $i] :
refl(
( ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) )
<=> ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ) )),
inference(bind,[status(th)],]) ).
tff(23,plain,
( ! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) )
<=> ! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ) ),
inference(quant_intro,[status(thm)],[22]) ).
tff(24,plain,
( ! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) )
<=> ! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ) ),
inference(rewrite,[status(thm)],]) ).
tff(25,axiom,
! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).
tff(26,plain,
! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
inference(skolemize,[status(sab)],[26]) ).
tff(28,plain,
! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) ),
inference(modus_ponens,[status(thm)],[27,23]) ).
tff(29,plain,
( ~ ! [B: $i,A: $i] : ( mult(A,mult(B,op_c)) = mult(mult(A,B),op_c) )
| ( mult(x0,mult(x1,op_c)) = mult(mult(x0,x1),op_c) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(30,plain,
mult(x0,mult(x1,op_c)) = mult(mult(x0,x1),op_c),
inference(unit_resolution,[status(thm)],[29,28]) ).
tff(31,plain,
ld(op_c,mult(op_c,op_c)) = op_d,
inference(symmetry,[status(thm)],[18]) ).
tff(32,plain,
op_c = ld(op_c,mult(op_c,op_c)),
inference(symmetry,[status(thm)],[9]) ).
tff(33,plain,
op_c = op_d,
inference(transitivity,[status(thm)],[32,31]) ).
tff(34,plain,
mult(x1,op_c) = mult(x1,op_d),
inference(monotonicity,[status(thm)],[33]) ).
tff(35,plain,
mult(x0,mult(x1,op_c)) = mult(x0,mult(x1,op_d)),
inference(monotonicity,[status(thm)],[34]) ).
tff(36,plain,
mult(x0,mult(x1,op_d)) = mult(x0,mult(x1,op_c)),
inference(symmetry,[status(thm)],[35]) ).
tff(37,plain,
mult(x0,mult(x1,op_d)) = mult(mult(x0,x1),op_d),
inference(transitivity,[status(thm)],[36,30,21]) ).
tff(38,plain,
( ( mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d) )
<=> ( mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d) ) ),
inference(rewrite,[status(thm)],]) ).
tff(39,axiom,
mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
tff(40,plain,
mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
$false,
inference(unit_resolution,[status(thm)],[40,37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Aug 31 20:18:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.14/0.35 Usage: tptp [options] [-file:]file
% 0.14/0.35 -h, -? prints this message.
% 0.14/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.14/0.35 -m, -model generate model.
% 0.14/0.35 -p, -proof generate proof.
% 0.14/0.35 -c, -core generate unsat core of named formulas.
% 0.14/0.35 -st, -statistics display statistics.
% 0.14/0.35 -t:timeout set timeout (in second).
% 0.14/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.14/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.14/0.35 -<param>:<value> configuration parameter and value.
% 0.14/0.35 -o:<output-file> file to place output in.
% 0.21/0.45 % SZS status Unsatisfiable
% 0.21/0.45 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------