TPTP Problem File: SWV030+1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : SWV030+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Domain : Software Verification
% Problem : Unsimplified proof obligation gauss_init_0033
% Version : [DFS04] axioms : Especial.
% English : Proof obligation emerging from the init-safety verification for
% the gauss program. init-safety ensures that each variable or
% individual array element has been assigned a defined value before
% it is used.
% Refs : [Fis04] Fischer (2004), Email to G. Sutcliffe
% : [DFS04] Denney et al. (2004), Using Automated Theorem Provers
% Source : [Fis04]
% Names : gauss_init_0033 [Fis04]
% Status : Theorem
% Rating : 0.31 v8.2.0, 0.28 v8.1.0, 0.22 v7.5.0, 0.28 v7.4.0, 0.27 v7.3.0, 0.24 v7.2.0, 0.21 v7.1.0, 0.30 v6.4.0, 0.35 v6.3.0, 0.38 v6.2.0, 0.40 v6.1.0, 0.47 v6.0.0, 0.39 v5.5.0, 0.52 v5.4.0, 0.54 v5.3.0, 0.56 v5.2.0, 0.50 v5.1.0, 0.52 v5.0.0, 0.54 v4.1.0, 0.52 v4.0.0, 0.54 v3.7.0, 0.55 v3.5.0, 0.58 v3.4.0, 0.63 v3.3.0
% Syntax : Number of formulae : 100 ( 64 unt; 0 def)
% Number of atoms : 298 ( 86 equ)
% Maximal formula atoms : 34 ( 2 avg)
% Number of connectives : 203 ( 5 ~; 17 |; 118 &)
% ( 5 <=>; 58 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 9 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 37 ( 37 usr; 19 con; 0-4 aty)
% Number of variables : 174 ( 174 !; 0 ?)
% SPC : FOF_THM_RFO_SEQ
% Comments :
% Bugfixes : v3.3.0 - Bugfix in SWV003+0
%------------------------------------------------------------------------------
%----Include NASA software certification axioms
include('Axioms/SWV003+0.ax').
%------------------------------------------------------------------------------
%----Proof obligation generated by the AutoBayes/AutoFilter system
fof(gauss_init_0033,conjecture,
( ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [A] :
( ( leq(n0,A)
& leq(A,n2) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n3) )
=> a_select3(simplex7_init,B,A) = init ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,minus(pv1376,n1)) )
=> a_select2(s_values7_init,C) = init ) )
=> ( init = init
& leq(n0,pv7)
& leq(n0,pv19)
& leq(n0,pv20)
& leq(n0,pv1376)
& leq(pv7,minus(n410,n1))
& leq(pv19,minus(n410,n1))
& leq(pv20,minus(n330,n1))
& leq(pv1376,n3)
& ! [D] :
( ( leq(n0,D)
& leq(D,n2) )
=> ! [E] :
( ( leq(n0,E)
& leq(E,n3) )
=> a_select3(simplex7_init,E,D) = init ) )
& ! [F] :
( ( leq(n0,F)
& leq(F,minus(pv1376,n1)) )
=> a_select2(s_values7_init,F) = init ) ) ) ).
%----Automatically generated axioms
fof(gt_5_4,axiom,
gt(n5,n4) ).
fof(gt_330_4,axiom,
gt(n330,n4) ).
fof(gt_410_4,axiom,
gt(n410,n4) ).
fof(gt_330_5,axiom,
gt(n330,n5) ).
fof(gt_410_5,axiom,
gt(n410,n5) ).
fof(gt_410_330,axiom,
gt(n410,n330) ).
fof(gt_4_tptp_minus_1,axiom,
gt(n4,tptp_minus_1) ).
fof(gt_5_tptp_minus_1,axiom,
gt(n5,tptp_minus_1) ).
fof(gt_330_tptp_minus_1,axiom,
gt(n330,tptp_minus_1) ).
fof(gt_410_tptp_minus_1,axiom,
gt(n410,tptp_minus_1) ).
fof(gt_0_tptp_minus_1,axiom,
gt(n0,tptp_minus_1) ).
fof(gt_1_tptp_minus_1,axiom,
gt(n1,tptp_minus_1) ).
fof(gt_2_tptp_minus_1,axiom,
gt(n2,tptp_minus_1) ).
fof(gt_3_tptp_minus_1,axiom,
gt(n3,tptp_minus_1) ).
fof(gt_4_0,axiom,
gt(n4,n0) ).
fof(gt_5_0,axiom,
gt(n5,n0) ).
fof(gt_330_0,axiom,
gt(n330,n0) ).
fof(gt_410_0,axiom,
gt(n410,n0) ).
fof(gt_1_0,axiom,
gt(n1,n0) ).
fof(gt_2_0,axiom,
gt(n2,n0) ).
fof(gt_3_0,axiom,
gt(n3,n0) ).
fof(gt_4_1,axiom,
gt(n4,n1) ).
fof(gt_5_1,axiom,
gt(n5,n1) ).
fof(gt_330_1,axiom,
gt(n330,n1) ).
fof(gt_410_1,axiom,
gt(n410,n1) ).
fof(gt_2_1,axiom,
gt(n2,n1) ).
fof(gt_3_1,axiom,
gt(n3,n1) ).
fof(gt_4_2,axiom,
gt(n4,n2) ).
fof(gt_5_2,axiom,
gt(n5,n2) ).
fof(gt_330_2,axiom,
gt(n330,n2) ).
fof(gt_410_2,axiom,
gt(n410,n2) ).
fof(gt_3_2,axiom,
gt(n3,n2) ).
fof(gt_4_3,axiom,
gt(n4,n3) ).
fof(gt_5_3,axiom,
gt(n5,n3) ).
fof(gt_330_3,axiom,
gt(n330,n3) ).
fof(gt_410_3,axiom,
gt(n410,n3) ).
fof(finite_domain_4,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n4) )
=> ( X = n0
| X = n1
| X = n2
| X = n3
| X = n4 ) ) ).
fof(finite_domain_5,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n5) )
=> ( X = n0
| X = n1
| X = n2
| X = n3
| X = n4
| X = n5 ) ) ).
fof(finite_domain_0,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n0) )
=> X = n0 ) ).
fof(finite_domain_1,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n1) )
=> ( X = n0
| X = n1 ) ) ).
fof(finite_domain_2,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n2) )
=> ( X = n0
| X = n1
| X = n2 ) ) ).
fof(finite_domain_3,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n3) )
=> ( X = n0
| X = n1
| X = n2
| X = n3 ) ) ).
fof(successor_4,axiom,
succ(succ(succ(succ(n0)))) = n4 ).
fof(successor_5,axiom,
succ(succ(succ(succ(succ(n0))))) = n5 ).
fof(successor_1,axiom,
succ(n0) = n1 ).
fof(successor_2,axiom,
succ(succ(n0)) = n2 ).
fof(successor_3,axiom,
succ(succ(succ(n0))) = n3 ).
%------------------------------------------------------------------------------