TPTP Problem File: RNG046+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : RNG046+1 : TPTP v9.0.0. Released v4.0.0.
% Domain : Ring Theory
% Problem : Cauchy-Bouniakowsky-Schwarz inequality 02, 00 expansion
% Version : Especial.
% English :
% Refs : [VLP07] Verchinine et al. (2007), System for Automated Deduction
% : [Pas08] Paskevich (2008), Email to G. Sutcliffe
% Source : [Pas08]
% Names : cauchy_02.00 [Pas08]
% Status : Theorem
% Rating : 0.21 v9.0.0, 0.22 v8.1.0, 0.25 v7.5.0, 0.28 v7.4.0, 0.13 v7.3.0, 0.17 v6.4.0, 0.19 v6.3.0, 0.21 v6.2.0, 0.24 v6.1.0, 0.30 v6.0.0, 0.17 v5.5.0, 0.30 v5.4.0, 0.36 v5.3.0, 0.37 v5.2.0, 0.30 v5.1.0, 0.33 v5.0.0, 0.38 v4.1.0, 0.35 v4.0.1, 0.78 v4.0.0
% Syntax : Number of formulae : 19 ( 3 unt; 0 def)
% Number of atoms : 64 ( 23 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 47 ( 2 ~; 0 |; 28 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 27 !; 1 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments : Problem generated by the SAD system [VLP07]
%------------------------------------------------------------------------------
fof(mNatSort,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> $true ) ).
fof(mZeroNat,axiom,
aNaturalNumber0(sz00) ).
fof(mSuccNat,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> ( aNaturalNumber0(szszuzczcdt0(W0))
& szszuzczcdt0(W0) != sz00 ) ) ).
fof(mNatExtr,axiom,
! [W0] :
( ( aNaturalNumber0(W0)
& W0 != sz00 )
=> ? [W1] :
( aNaturalNumber0(W1)
& W0 = szszuzczcdt0(W1) ) ) ).
fof(mSuccEqu,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( szszuzczcdt0(W0) = szszuzczcdt0(W1)
=> W0 = W1 ) ) ).
fof(mIHOrd,axiom,
! [W0,W1] :
( ( aNaturalNumber0(W0)
& aNaturalNumber0(W1) )
=> ( iLess0(W0,W1)
=> $true ) ) ).
fof(mIH,axiom,
! [W0] :
( aNaturalNumber0(W0)
=> iLess0(W0,szszuzczcdt0(W0)) ) ).
fof(mScSort,axiom,
! [W0] :
( aScalar0(W0)
=> $true ) ).
fof(mSZeroSc,axiom,
aScalar0(sz0z00) ).
fof(mSumSc,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> aScalar0(sdtpldt0(W0,W1)) ) ).
fof(mMulSc,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> aScalar0(sdtasdt0(W0,W1)) ) ).
fof(mNegSc,axiom,
! [W0] :
( aScalar0(W0)
=> aScalar0(smndt0(W0)) ) ).
fof(mScZero,axiom,
! [W0] :
( aScalar0(W0)
=> ( sdtpldt0(W0,sz0z00) = W0
& sdtpldt0(sz0z00,W0) = W0
& sdtasdt0(W0,sz0z00) = sz0z00
& sdtasdt0(sz0z00,W0) = sz0z00
& sdtpldt0(W0,smndt0(W0)) = sz0z00
& sdtpldt0(smndt0(W0),W0) = sz0z00
& smndt0(smndt0(W0)) = W0
& smndt0(sz0z00) = sz0z00 ) ) ).
fof(mArith,axiom,
! [W0,W1,W2] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2) )
=> ( sdtpldt0(sdtpldt0(W0,W1),W2) = sdtpldt0(W0,sdtpldt0(W1,W2))
& sdtpldt0(W0,W1) = sdtpldt0(W1,W0)
& sdtasdt0(sdtasdt0(W0,W1),W2) = sdtasdt0(W0,sdtasdt0(W1,W2))
& sdtasdt0(W0,W1) = sdtasdt0(W1,W0) ) ) ).
fof(mDistr,axiom,
! [W0,W1,W2] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2) )
=> ( sdtasdt0(W0,sdtpldt0(W1,W2)) = sdtpldt0(sdtasdt0(W0,W1),sdtasdt0(W0,W2))
& sdtasdt0(sdtpldt0(W0,W1),W2) = sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W1,W2)) ) ) ).
fof(mDistr2,axiom,
! [W0,W1,W2,W3] :
( ( aScalar0(W0)
& aScalar0(W1)
& aScalar0(W2)
& aScalar0(W3) )
=> sdtasdt0(sdtpldt0(W0,W1),sdtpldt0(W2,W3)) = sdtpldt0(sdtpldt0(sdtasdt0(W0,W2),sdtasdt0(W0,W3)),sdtpldt0(sdtasdt0(W1,W2),sdtasdt0(W1,W3))) ) ).
fof(mMNeg,axiom,
! [W0,W1] :
( ( aScalar0(W0)
& aScalar0(W1) )
=> ( sdtasdt0(W0,smndt0(W1)) = smndt0(sdtasdt0(W0,W1))
& sdtasdt0(smndt0(W0),W1) = smndt0(sdtasdt0(W0,W1)) ) ) ).
fof(m__799,hypothesis,
( aScalar0(xx)
& aScalar0(xy) ) ).
fof(m__,conjecture,
sdtasdt0(smndt0(xx),smndt0(xy)) = sdtasdt0(xx,xy) ).
%------------------------------------------------------------------------------