%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : GRP533-1 : TPTP v9.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n016.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 : Sat Jun 21 05:08:02 AM UTC 2025
% Result : Unsatisfiable 0.12s 0.38s
% Output : Proof 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 47 ( 34 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 62 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 26 ( 10 ~; 6 |; 0 &)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 60 !; 0 ?; 66 :)
% Comments :
%------------------------------------------------------------------------------
tff(multiply_type,type,
multiply: ( $i * $i ) > $i ).
tff(b1_type,type,
b1: $i ).
tff(inverse_type,type,
inverse: $i > $i ).
tff(a1_type,type,
a1: $i ).
tff(divide_type,type,
divide: ( $i * $i ) > $i ).
tff(identity_type,type,
identity: $i ).
tff(1,plain,
^ [B: $i,A: $i] :
refl(( ( inverse(A) = divide(divide(B,B),A) )
<=> ( inverse(A) = divide(divide(B,B),A) ) )),
inference(bind,[status(th)],[]) ).
tff(2,plain,
( ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) )
<=> ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) )
<=> ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(4,axiom,
! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
tff(5,plain,
! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ),
inference(modus_ponens,[status(thm)],[4,3]) ).
tff(6,plain,
! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ),
inference(skolemize,[status(sab)],[5]) ).
tff(7,plain,
! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) ),
inference(modus_ponens,[status(thm)],[6,2]) ).
tff(8,plain,
( ~ ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) )
| ( inverse(b1) = divide(divide(inverse(a1),inverse(a1)),b1) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(9,plain,
inverse(b1) = divide(divide(inverse(a1),inverse(a1)),b1),
inference(unit_resolution,[status(thm)],[8,7]) ).
tff(10,plain,
multiply(inverse(b1),b1) = multiply(divide(divide(inverse(a1),inverse(a1)),b1),b1),
inference(monotonicity,[status(thm)],[9]) ).
tff(11,plain,
multiply(divide(divide(inverse(a1),inverse(a1)),b1),b1) = multiply(inverse(b1),b1),
inference(symmetry,[status(thm)],[10]) ).
tff(12,plain,
^ [B: $i,A: $i,C: $i] :
refl(( ( multiply(A,B) = divide(A,divide(divide(C,C),B)) )
<=> ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ) )),
inference(bind,[status(th)],[]) ).
tff(13,plain,
( ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) )
<=> ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ) ),
inference(quant_intro,[status(thm)],[12]) ).
tff(14,plain,
( ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) )
<=> ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(15,axiom,
! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
tff(16,plain,
! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
inference(skolemize,[status(sab)],[16]) ).
tff(18,plain,
! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
inference(modus_ponens,[status(thm)],[17,13]) ).
tff(19,plain,
( ~ ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) )
| ( multiply(divide(divide(inverse(a1),inverse(a1)),b1),b1) = divide(divide(divide(inverse(a1),inverse(a1)),b1),divide(divide(inverse(a1),inverse(a1)),b1)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(20,plain,
multiply(divide(divide(inverse(a1),inverse(a1)),b1),b1) = divide(divide(divide(inverse(a1),inverse(a1)),b1),divide(divide(inverse(a1),inverse(a1)),b1)),
inference(unit_resolution,[status(thm)],[19,18]) ).
tff(21,plain,
divide(divide(divide(inverse(a1),inverse(a1)),b1),divide(divide(inverse(a1),inverse(a1)),b1)) = multiply(divide(divide(inverse(a1),inverse(a1)),b1),b1),
inference(symmetry,[status(thm)],[20]) ).
tff(22,plain,
divide(divide(inverse(a1),inverse(a1)),b1) = inverse(b1),
inference(symmetry,[status(thm)],[9]) ).
tff(23,plain,
divide(divide(divide(inverse(a1),inverse(a1)),b1),divide(divide(inverse(a1),inverse(a1)),b1)) = divide(inverse(b1),inverse(b1)),
inference(monotonicity,[status(thm)],[22,22]) ).
tff(24,plain,
divide(inverse(b1),inverse(b1)) = divide(divide(divide(inverse(a1),inverse(a1)),b1),divide(divide(inverse(a1),inverse(a1)),b1)),
inference(symmetry,[status(thm)],[23]) ).
tff(25,plain,
^ [A: $i] :
refl(( ( identity = divide(A,A) )
<=> ( identity = divide(A,A) ) )),
inference(bind,[status(th)],[]) ).
tff(26,plain,
( ! [A: $i] : ( identity = divide(A,A) )
<=> ! [A: $i] : ( identity = divide(A,A) ) ),
inference(quant_intro,[status(thm)],[25]) ).
tff(27,plain,
( ! [A: $i] : ( identity = divide(A,A) )
<=> ! [A: $i] : ( identity = divide(A,A) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(28,axiom,
! [A: $i] : ( identity = divide(A,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
tff(29,plain,
! [A: $i] : ( identity = divide(A,A) ),
inference(modus_ponens,[status(thm)],[28,27]) ).
tff(30,plain,
! [A: $i] : ( identity = divide(A,A) ),
inference(skolemize,[status(sab)],[29]) ).
tff(31,plain,
! [A: $i] : ( identity = divide(A,A) ),
inference(modus_ponens,[status(thm)],[30,26]) ).
tff(32,plain,
( ~ ! [A: $i] : ( identity = divide(A,A) )
| ( identity = divide(inverse(b1),inverse(b1)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(33,plain,
identity = divide(inverse(b1),inverse(b1)),
inference(unit_resolution,[status(thm)],[32,31]) ).
tff(34,plain,
( ~ ! [A: $i] : ( identity = divide(A,A) )
| ( identity = divide(inverse(a1),inverse(a1)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(35,plain,
identity = divide(inverse(a1),inverse(a1)),
inference(unit_resolution,[status(thm)],[34,31]) ).
tff(36,plain,
divide(inverse(a1),inverse(a1)) = identity,
inference(symmetry,[status(thm)],[35]) ).
tff(37,plain,
( ~ ! [B: $i,A: $i] : ( inverse(A) = divide(divide(B,B),A) )
| ( inverse(a1) = divide(divide(inverse(a1),inverse(a1)),a1) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(38,plain,
inverse(a1) = divide(divide(inverse(a1),inverse(a1)),a1),
inference(unit_resolution,[status(thm)],[37,7]) ).
tff(39,plain,
divide(divide(inverse(a1),inverse(a1)),a1) = inverse(a1),
inference(symmetry,[status(thm)],[38]) ).
tff(40,plain,
divide(inverse(a1),divide(divide(inverse(a1),inverse(a1)),a1)) = divide(inverse(a1),inverse(a1)),
inference(monotonicity,[status(thm)],[39]) ).
tff(41,plain,
( ~ ! [B: $i,A: $i,C: $i] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) )
| ( multiply(inverse(a1),a1) = divide(inverse(a1),divide(divide(inverse(a1),inverse(a1)),a1)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(42,plain,
multiply(inverse(a1),a1) = divide(inverse(a1),divide(divide(inverse(a1),inverse(a1)),a1)),
inference(unit_resolution,[status(thm)],[41,18]) ).
tff(43,plain,
multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
inference(transitivity,[status(thm)],[42,40,36,33,24,21,11]) ).
tff(44,plain,
( ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1) )
<=> ( multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(45,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
tff(46,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(modus_ponens,[status(thm)],[45,44]) ).
tff(47,plain,
$false,
inference(unit_resolution,[status(thm)],[46,43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP533-1 : TPTP v9.0.0. Released v2.6.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.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 : Thu Jun 19 16:15:47 EDT 2025
% 0.12/0.34 % CPUTime :
% 0.12/0.38 % SZS status Unsatisfiable
% 0.12/0.38 % SZS output start Proof
% See solution above
% 0.12/0.39 % E exiting
%------------------------------------------------------------------------------