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