TSTP Solution File: GRP750-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : GRP750-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n001.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 May 19 11:15:19 EDT 2023
% Result : Unsatisfiable 22.16s 4.60s
% Output : Refutation 22.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 106 ( 55 unt; 6 typ; 0 def)
% Number of atoms : 155 ( 154 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 1361 ( 118 ~; 55 |; 0 &;1188 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 181 ( 0 ^; 181 !; 0 ?; 181 :)
% Comments :
%------------------------------------------------------------------------------
thf(mult_type,type,
mult: $i > $i > $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(c_type,type,
c: $i ).
thf(ld_type,type,
ld: $i > $i > $i ).
thf(rd_type,type,
rd: $i > $i > $i ).
thf(4,axiom,
! [B: $i,A: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( mult @ ( rd @ A @ B ) @ B )
= A ),
inference(lifteq,[status(thm)],[15]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
thf(13,plain,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( ld @ A @ ( mult @ A @ B ) )
= B ),
inference(lifteq,[status(thm)],[13]) ).
thf(115,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( ld @ C @ A )
= D )
| ( ( mult @ ( rd @ A @ B ) @ B )
!= ( mult @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[16,14]) ).
thf(116,plain,
! [B: $i,A: $i] :
( ( ld @ ( rd @ A @ B ) @ A )
= B ),
inference(pattern_uni,[status(thm)],[115:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( rd @ E @ F )),bind(D,$thf( F ))]]) ).
thf(166,plain,
! [B: $i,A: $i] :
( ( ld @ ( rd @ A @ B ) @ A )
= B ),
inference(simp,[status(thm)],[116]) ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
thf(11,plain,
! [B: $i,A: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ( mult @ A @ ( ld @ A @ B ) )
= B ),
inference(lifteq,[status(thm)],[11]) ).
thf(1,negated_conjecture,
( ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
thf(8,plain,
( ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(9,plain,
( ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ),
inference(polarity_switch,[status(thm)],[8]) ).
thf(10,plain,
( ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(25,plain,
! [B: $i,A: $i] :
( ( ( mult @ B @ ( mult @ a @ c ) )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ a @ b ) ) ),
inference(paramod_ordered,[status(thm)],[12,10]) ).
thf(30,plain,
! [B: $i,A: $i] :
( ( ( mult @ B @ ( mult @ a @ c ) )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( A != a )
| ( ( ld @ A @ B )
!= b ) ),
inference(simp,[status(thm)],[25]) ).
thf(40,plain,
! [A: $i] :
( ( ( mult @ A @ ( mult @ a @ c ) )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ A )
!= b ) ),
inference(simp,[status(thm)],[30]) ).
thf(3195,plain,
! [C: $i,B: $i,A: $i] :
( ( A
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ C )
!= b )
| ( ( mult @ ( rd @ A @ B ) @ B )
!= ( mult @ C @ ( mult @ a @ c ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,40]) ).
thf(3196,plain,
! [A: $i] :
( ( A
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ ( rd @ A @ ( mult @ a @ c ) ) )
!= b ) ),
inference(pattern_uni,[status(thm)],[3195:[bind(A,$thf( D )),bind(B,$thf( mult @ a @ c )),bind(C,$thf( rd @ D @ ( mult @ a @ c ) ))]]) ).
thf(3375,plain,
( ( ld @ a @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) )
!= b ),
inference(simp,[status(thm)],[3196]) ).
thf(3477,plain,
! [B: $i,A: $i] :
( ( B != b )
| ( ( ld @ ( rd @ A @ B ) @ A )
!= ( ld @ a @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[166,3375]) ).
thf(3498,plain,
! [A: $i] :
( ( ( rd @ A @ b )
!= a )
| ( A
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) ) ),
inference(simp,[status(thm)],[3477]) ).
thf(3549,plain,
( ( rd @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) @ b )
!= a ),
inference(simp,[status(thm)],[3498]) ).
thf(26,plain,
! [B: $i,A: $i] :
( ( ( mult @ ( mult @ a @ b ) @ B )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ a @ c ) ) ),
inference(paramod_ordered,[status(thm)],[12,10]) ).
thf(34,plain,
! [B: $i,A: $i] :
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( B
!= ( mult @ b @ c ) )
| ( A != a )
| ( ( ld @ A @ B )
!= c ) ),
inference(simp,[status(thm)],[26]) ).
thf(37,plain,
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( ( ld @ a @ ( mult @ b @ c ) )
!= c ) ),
inference(simp,[status(thm)],[34]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ ( mult @ A @ A ) ) @ ( mult @ B @ C ) )
= ( mult @ ( mult @ A @ B ) @ ( mult @ ( mult @ A @ A ) @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
thf(19,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ ( mult @ A @ A ) ) @ ( mult @ B @ C ) )
= ( mult @ ( mult @ A @ B ) @ ( mult @ ( mult @ A @ A ) @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ ( mult @ A @ A ) ) @ ( mult @ B @ C ) )
= ( mult @ ( mult @ A @ B ) @ ( mult @ ( mult @ A @ A ) @ C ) ) ),
inference(lifteq,[status(thm)],[19]) ).
thf(112,plain,
! [B: $i,A: $i] :
( ( A
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( mult @ ( rd @ A @ B ) @ B )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ),
inference(paramod_ordered,[status(thm)],[16,10]) ).
thf(141,plain,
! [A: $i] :
( ( mult @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ A ) @ A )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[112]) ).
thf(160,plain,
! [A: $i] :
( ( mult @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ A ) @ A )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[141]) ).
thf(726,plain,
! [C: $i,B: $i,A: $i] :
( ( B
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ C ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[12,160]) ).
thf(755,plain,
! [B: $i,A: $i] :
( ( A
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ B ) )
| ( ( ld @ A @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= B ) ),
inference(simp,[status(thm)],[726]) ).
thf(857,plain,
! [A: $i] :
( ( ld @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ A ) @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= A ),
inference(simp,[status(thm)],[755]) ).
thf(23,plain,
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( ( mult @ b @ c )
!= ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[10]) ).
thf(66,plain,
! [B: $i,A: $i] :
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( B
!= ( mult @ a @ c ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ b @ c ) ) ),
inference(paramod_ordered,[status(thm)],[12,23]) ).
thf(75,plain,
! [A: $i] :
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( A != b )
| ( ( ld @ A @ ( mult @ a @ c ) )
!= c ) ),
inference(simp,[status(thm)],[66]) ).
thf(96,plain,
( ( ( mult @ a @ b )
!= ( mult @ a @ a ) )
| ( ( ld @ b @ ( mult @ a @ c ) )
!= c ) ),
inference(simp,[status(thm)],[75]) ).
thf(64,plain,
( ( a != a )
| ( b != a )
| ( b != a )
| ( c != c ) ),
inference(simp,[status(thm)],[23]) ).
thf(91,plain,
b != a,
inference(simp,[status(thm)],[64]) ).
thf(33,plain,
! [B: $i,A: $i] :
( ( ( mult @ ( mult @ a @ b ) @ B )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( A != a )
| ( ( ld @ A @ B )
!= c ) ),
inference(simp,[status(thm)],[26]) ).
thf(36,plain,
! [A: $i] :
( ( ( mult @ ( mult @ a @ b ) @ A )
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ A )
!= c ) ),
inference(simp,[status(thm)],[33]) ).
thf(1890,plain,
! [C: $i,B: $i,A: $i] :
( ( B
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ C )
!= c )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ ( mult @ a @ b ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[12,36]) ).
thf(1891,plain,
! [A: $i] :
( ( A
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( ld @ a @ ( ld @ ( mult @ a @ b ) @ A ) )
!= c ) ),
inference(pattern_uni,[status(thm)],[1890:[bind(A,$thf( mult @ a @ b )),bind(B,$thf( G )),bind(C,$thf( ld @ ( mult @ a @ b ) @ G ))]]) ).
thf(1958,plain,
( ( ld @ a @ ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) )
!= c ),
inference(simp,[status(thm)],[1891]) ).
thf(24,plain,
! [B: $i,A: $i] :
( ( B
!= ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ),
inference(paramod_ordered,[status(thm)],[12,10]) ).
thf(28,plain,
! [A: $i] :
( ( A
!= ( mult @ a @ b ) )
| ( ( ld @ A @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
!= ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[24]) ).
thf(38,plain,
( ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) )
!= ( mult @ a @ c ) ),
inference(simp,[status(thm)],[28]) ).
thf(7,axiom,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) )
= ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
thf(21,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) )
= ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(22,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) )
= ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) ),
inference(lifteq,[status(thm)],[21]) ).
thf(5,axiom,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ( rd @ ( mult @ A @ B ) @ B )
= A ),
inference(lifteq,[status(thm)],[17]) ).
thf(275,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( rd @ ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) @ E )
= D )
| ( ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) )
!= ( mult @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[22,18]) ).
thf(276,plain,
! [C: $i,B: $i,A: $i] :
( ( rd @ ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) @ ( mult @ C @ C ) )
= ( mult @ A @ B ) ),
inference(pattern_uni,[status(thm)],[275:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( I )),bind(D,$thf( mult @ F @ G )),bind(E,$thf( mult @ I @ I ))]]) ).
thf(393,plain,
! [C: $i,B: $i,A: $i] :
( ( rd @ ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) ) @ ( mult @ C @ C ) )
= ( mult @ A @ B ) ),
inference(simp,[status(thm)],[276]) ).
thf(208,plain,
! [B: $i,A: $i] :
( ( B
!= ( mult @ a @ c ) )
| ( ( ld @ ( rd @ A @ B ) @ A )
!= ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[166,38]) ).
thf(214,plain,
! [A: $i] :
( ( ld @ ( rd @ A @ ( mult @ a @ c ) ) @ A )
!= ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ),
inference(simp,[status(thm)],[208]) ).
thf(939,plain,
! [C: $i,B: $i,A: $i] :
( ( B
!= ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) )
| ( ( ld @ A @ ( mult @ A @ B ) )
!= ( ld @ ( rd @ C @ ( mult @ a @ c ) ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[14,214]) ).
thf(973,plain,
! [B: $i,A: $i] :
( ( A
!= ( rd @ B @ ( mult @ a @ c ) ) )
| ( ( mult @ A @ ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) )
!= B ) ),
inference(simp,[status(thm)],[939]) ).
thf(985,plain,
! [A: $i] :
( ( mult @ ( rd @ A @ ( mult @ a @ c ) ) @ ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) )
!= A ),
inference(simp,[status(thm)],[973]) ).
thf(1452,plain,
! [C: $i,B: $i,A: $i] :
( ( B != C )
| ( ( ld @ ( rd @ A @ B ) @ A )
!= ( ld @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ C ) @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[166,857]) ).
thf(1521,plain,
! [B: $i,A: $i] :
( ( ( rd @ A @ B )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ B ) )
| ( A
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ),
inference(simp,[status(thm)],[1452]) ).
thf(1548,plain,
! [A: $i] :
( ( rd @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) @ A )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ A ) ),
inference(simp,[status(thm)],[1521]) ).
thf(142,plain,
! [A: $i] :
( ( ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ A )
!= ( mult @ a @ b ) )
| ( A
!= ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[112]) ).
thf(161,plain,
( ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) )
!= ( mult @ a @ b ) ),
inference(simp,[status(thm)],[142]) ).
thf(1444,plain,
! [C: $i,B: $i,A: $i] :
( ( ( ld @ A @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= C )
| ( ( rd @ ( mult @ A @ B ) @ B )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[18,857]) ).
thf(1445,plain,
( ( ld @ ( mult @ a @ a ) @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= ( mult @ b @ c ) ),
inference(pattern_uni,[status(thm)],[1444:[bind(A,$thf( mult @ a @ a )),bind(B,$thf( mult @ b @ c )),bind(C,$thf( mult @ b @ c ))]]) ).
thf(1571,plain,
! [B: $i,A: $i] :
( ( B
!= ( mult @ b @ c ) )
| ( ( ld @ ( rd @ A @ B ) @ A )
!= ( ld @ ( mult @ a @ a ) @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[166,1445]) ).
thf(1621,plain,
! [A: $i] :
( ( ( rd @ A @ ( mult @ b @ c ) )
!= ( mult @ a @ a ) )
| ( A
!= ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) ) ),
inference(simp,[status(thm)],[1571]) ).
thf(1631,plain,
( ( rd @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) @ ( mult @ b @ c ) )
!= ( mult @ a @ a ) ),
inference(simp,[status(thm)],[1621]) ).
thf(170,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ( rd @ B @ D )
= C )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[12,18]) ).
thf(171,plain,
! [B: $i,A: $i] :
( ( rd @ B @ ( ld @ A @ B ) )
= A ),
inference(pattern_uni,[status(thm)],[170:[bind(A,$thf( E )),bind(B,$thf( F )),bind(C,$thf( E )),bind(D,$thf( ld @ E @ F ))]]) ).
thf(176,plain,
! [B: $i,A: $i] :
( ( rd @ B @ ( ld @ A @ B ) )
= A ),
inference(simp,[status(thm)],[171]) ).
thf(181,plain,
! [B: $i,A: $i] :
( ( A
!= ( mult @ a @ b ) )
| ( ( rd @ ( mult @ A @ B ) @ B )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) ) ),
inference(paramod_ordered,[status(thm)],[18,161]) ).
thf(190,plain,
! [A: $i] :
( ( rd @ ( mult @ ( mult @ a @ b ) @ A ) @ A )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[181]) ).
thf(204,plain,
! [A: $i] :
( ( rd @ ( mult @ ( mult @ a @ b ) @ A ) @ A )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) ),
inference(simp,[status(thm)],[190]) ).
thf(879,plain,
! [C: $i,B: $i,A: $i] :
( ( A
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) )
| ( ( rd @ B @ ( ld @ A @ B ) )
!= ( rd @ ( mult @ ( mult @ a @ b ) @ C ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[176,204]) ).
thf(896,plain,
! [B: $i,A: $i] :
( ( A
!= ( mult @ ( mult @ a @ b ) @ B ) )
| ( ( ld @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) @ A )
!= B ) ),
inference(simp,[status(thm)],[879]) ).
thf(912,plain,
! [A: $i] :
( ( ld @ ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ ( mult @ a @ c ) ) @ ( mult @ ( mult @ a @ b ) @ A ) )
!= A ),
inference(simp,[status(thm)],[896]) ).
thf(277,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( rd @ ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) ) @ E )
= D )
| ( ( mult @ ( mult @ A @ C ) @ ( mult @ B @ C ) )
!= ( mult @ D @ E ) ) ),
inference(paramod_ordered,[status(thm)],[22,18]) ).
thf(278,plain,
! [C: $i,B: $i,A: $i] :
( ( rd @ ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) ) @ ( mult @ B @ C ) )
= ( mult @ A @ C ) ),
inference(pattern_uni,[status(thm)],[277:[bind(A,$thf( F )),bind(B,$thf( H )),bind(C,$thf( I )),bind(D,$thf( mult @ F @ I )),bind(E,$thf( mult @ H @ I ))]]) ).
thf(394,plain,
! [C: $i,B: $i,A: $i] :
( ( rd @ ( mult @ ( mult @ A @ B ) @ ( mult @ C @ C ) ) @ ( mult @ B @ C ) )
= ( mult @ A @ C ) ),
inference(simp,[status(thm)],[278]) ).
thf(2085,plain,
! [B: $i,A: $i] :
( ( B != c )
| ( ( ld @ ( rd @ A @ B ) @ A )
!= ( ld @ a @ ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[166,1958]) ).
thf(2120,plain,
! [A: $i] :
( ( ( rd @ A @ c )
!= a )
| ( A
!= ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ) ),
inference(simp,[status(thm)],[2085]) ).
thf(2143,plain,
( ( rd @ ( ld @ ( mult @ a @ b ) @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) @ c )
!= a ),
inference(simp,[status(thm)],[2120]) ).
thf(1453,plain,
! [C: $i,B: $i,A: $i] :
( ( ( ld @ A @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= C )
| ( ( rd @ B @ ( ld @ A @ B ) )
!= ( rd @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) @ C ) ) ),
inference(paramod_ordered,[status(thm)],[176,857]) ).
thf(1454,plain,
! [A: $i] :
( ( ld @ A @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= ( ld @ A @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ),
inference(pattern_uni,[status(thm)],[1453:[bind(A,$thf( J )),bind(B,$thf( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) )),bind(C,$thf( ld @ J @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ))]]) ).
thf(1531,plain,
! [A: $i] :
( ( ld @ A @ ( mult @ ( mult @ a @ b ) @ ( mult @ a @ c ) ) )
!= ( ld @ A @ ( mult @ ( mult @ a @ a ) @ ( mult @ b @ c ) ) ) ),
inference(simp,[status(thm)],[1454]) ).
thf(268,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( mult @ B @ ( mult @ E @ E ) )
= ( mult @ ( mult @ C @ E ) @ ( mult @ D @ E ) ) )
| ( ( mult @ A @ ( ld @ A @ B ) )
!= ( mult @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[12,22]) ).
thf(269,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ C @ ( mult @ A @ A ) )
= ( mult @ ( mult @ B @ A ) @ ( mult @ ( ld @ B @ C ) @ A ) ) ),
inference(pattern_uni,[status(thm)],[268:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( F )),bind(D,$thf( ld @ F @ G ))]]) ).
thf(390,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ C @ ( mult @ A @ A ) )
= ( mult @ ( mult @ B @ A ) @ ( mult @ ( ld @ B @ C ) @ A ) ) ),
inference(simp,[status(thm)],[269]) ).
thf(283,plain,
! [E: $i,D: $i,C: $i,B: $i,A: $i] :
( ( ( mult @ A @ ( mult @ E @ E ) )
= ( mult @ ( mult @ C @ E ) @ ( mult @ D @ E ) ) )
| ( ( mult @ ( rd @ A @ B ) @ B )
!= ( mult @ C @ D ) ) ),
inference(paramod_ordered,[status(thm)],[16,22]) ).
thf(284,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ ( rd @ B @ C ) @ A ) @ ( mult @ C @ A ) )
= ( mult @ B @ ( mult @ A @ A ) ) ),
inference(pattern_uni,[status(thm)],[283:[bind(A,$thf( F )),bind(B,$thf( G )),bind(C,$thf( rd @ F @ G )),bind(D,$thf( G ))]]) ).
thf(395,plain,
! [C: $i,B: $i,A: $i] :
( ( mult @ ( mult @ ( rd @ B @ C ) @ A ) @ ( mult @ C @ A ) )
= ( mult @ B @ ( mult @ A @ A ) ) ),
inference(simp,[status(thm)],[284]) ).
thf(6616,plain,
$false,
inference(e,[status(thm)],[3549,10,37,14,20,857,96,12,91,1958,16,11,38,160,21,393,985,13,166,1548,161,3375,17,1631,176,22,204,912,1445,394,18,2143,1531,40,390,23,8,214,36,19,395,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP750-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 19 02:26:36 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.86/0.83 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.94 % [INFO] Parsing done (114ms).
% 1.21/0.95 % [INFO] Running in sequential loop mode.
% 1.48/1.14 % [INFO] eprover registered as external prover.
% 1.48/1.14 % [INFO] cvc4 registered as external prover.
% 1.48/1.15 % [INFO] Scanning for conjecture ...
% 1.73/1.19 % [INFO] Found a conjecture and 6 axioms. Running axiom selection ...
% 1.81/1.21 % [INFO] Axiom selection finished. Selected 6 axioms (removed 0 axioms).
% 1.81/1.22 % [INFO] Problem is propositional (TPTP CNF).
% 1.81/1.23 % [INFO] Type checking passed.
% 1.81/1.23 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 22.16/4.59 % External prover 'e' found a proof!
% 22.16/4.60 % [INFO] Killing All external provers ...
% 22.16/4.60 % Time passed: 4089ms (effective reasoning time: 3644ms)
% 22.16/4.60 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 22.16/4.60 % Axioms used in derivation (6): f03, f02, f06, f05, f04, f01
% 22.16/4.60 % No. of inferences in proof: 100
% 22.16/4.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4089 ms resp. 3644 ms w/o parsing
% 22.30/4.65 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 22.30/4.65 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------