TSTP Solution File: SWC377-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC377-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %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 : 600s
% DateTime : Tue Jul 19 22:03:40 EDT 2022
% Result : Unsatisfiable 8.91s 9.12s
% Output : Refutation 10.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC377-1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n028.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 : 600
% 0.14/0.35 % DateTime : Sun Jun 12 06:26:06 EDT 2022
% 0.14/0.35 % CPUTime :
% 8.91/9.12
% 8.91/9.12 SPASS V 3.9
% 8.91/9.12 SPASS beiseite: Proof found.
% 8.91/9.12 % SZS status Theorem
% 8.91/9.12 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.91/9.12 SPASS derived 13246 clauses, backtracked 4027 clauses, performed 59 splits and kept 10267 clauses.
% 8.91/9.12 SPASS allocated 90719 KBytes.
% 8.91/9.12 SPASS spent 0:00:08.73 on the problem.
% 8.91/9.12 0:00:00.04 for the input.
% 8.91/9.12 0:00:00.00 for the FLOTTER CNF translation.
% 8.91/9.12 0:00:00.15 for inferences.
% 8.91/9.12 0:00:00.28 for the backtracking.
% 8.91/9.12 0:00:08.06 for the reduction.
% 8.91/9.12
% 8.91/9.12
% 8.91/9.12 Here is a proof with depth 4, length 160 :
% 8.91/9.12 % SZS output start Refutation
% 8.91/9.12 2[0:Inp] || -> ssList(sk2)*.
% 8.91/9.12 5[0:Inp] || -> equal(sk4,sk2)**.
% 8.91/9.12 6[0:Inp] || -> equal(sk3,sk1)**.
% 8.91/9.12 7[0:Inp] || -> ssItem(sk5)*.
% 8.91/9.12 8[0:Inp] || -> memberP(sk1,sk5) memberP(sk2,sk5)*.
% 8.91/9.12 9[0:Inp] || memberP(sk1,sk5) memberP(sk2,sk5)* -> .
% 8.91/9.12 10[0:Inp] || equal(nil,sk4) -> equal(sk3,nil)**.
% 8.91/9.12 11[0:Inp] || neq(sk4,nil)* -> ssItem(sk6).
% 8.91/9.12 12[0:Inp] || neq(sk4,nil)* -> ssList(sk7).
% 8.91/9.12 13[0:Inp] || neq(sk4,nil) -> equal(app(cons(sk6,nil),sk7),sk3)**.
% 8.91/9.12 14[0:Inp] || neq(sk4,nil) -> equal(app(sk7,cons(sk6,nil)),sk4)**.
% 8.91/9.12 15[0:Inp] || -> equalelemsP(nil)*.
% 8.91/9.12 16[0:Inp] || -> duplicatefreeP(nil)*.
% 8.91/9.12 17[0:Inp] || -> strictorderedP(nil)*.
% 8.91/9.12 18[0:Inp] || -> totalorderedP(nil)*.
% 8.91/9.12 19[0:Inp] || -> strictorderP(nil)*.
% 8.91/9.12 20[0:Inp] || -> totalorderP(nil)*.
% 8.91/9.12 21[0:Inp] || -> cyclefreeP(nil)*.
% 8.91/9.12 22[0:Inp] || -> ssList(nil)*.
% 8.91/9.12 78[0:Inp] ssItem(u) || -> equalelemsP(cons(u,nil))*.
% 8.91/9.12 79[0:Inp] ssItem(u) || -> duplicatefreeP(cons(u,nil))*.
% 8.91/9.12 80[0:Inp] ssItem(u) || -> strictorderedP(cons(u,nil))*.
% 8.91/9.12 81[0:Inp] ssItem(u) || -> totalorderedP(cons(u,nil))*.
% 8.91/9.12 82[0:Inp] ssItem(u) || -> strictorderP(cons(u,nil))*.
% 8.91/9.12 83[0:Inp] ssItem(u) || -> totalorderP(cons(u,nil))*.
% 8.91/9.12 84[0:Inp] ssItem(u) || -> cyclefreeP(cons(u,nil))*.
% 8.91/9.12 85[0:Inp] ssItem(u) || memberP(nil,u)* -> .
% 8.91/9.12 86[0:Inp] ssList(u) || -> ssItem(v)* duplicatefreeP(u)*.
% 8.91/9.12 99[0:Inp] ssList(u) ssList(v) || -> ssList(app(u,v))*.
% 8.91/9.12 100[0:Inp] ssList(u) ssItem(v) || -> ssList(cons(v,u))*.
% 8.91/9.12 114[0:Inp] ssList(u) ssList(v) || -> equal(u,v) neq(u,v)*.
% 8.91/9.12 116[0:Inp] ssItem(u) ssItem(v) || -> equal(u,v) neq(u,v)*.
% 8.91/9.12 130[0:Inp] ssList(u) ssItem(v) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 8.91/9.12 134[0:Inp] ssList(u) ssItem(v) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 8.91/9.12 152[0:Inp] ssItem(u) ssItem(v) ssList(w) || equal(u,v) -> memberP(cons(v,w),u)*.
% 8.91/9.12 153[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(w,u) -> memberP(cons(v,w),u)*.
% 8.91/9.12 154[0:Inp] ssItem(u) ssList(v) ssList(w) || memberP(v,u) -> memberP(app(v,w),u)*.
% 8.91/9.12 155[0:Inp] ssItem(u) ssList(v) ssList(w) || memberP(w,u) -> memberP(app(v,w),u)*.
% 8.91/9.12 171[0:Inp] ssList(u) ssList(v) ssItem(w) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 8.91/9.12 172[0:Inp] ssItem(u) ssList(v) ssList(w) || memberP(app(v,w),u)* -> memberP(v,u) memberP(w,u).
% 8.91/9.12 175[0:Inp] ssItem(u) ssItem(v) ssList(w) || memberP(cons(v,w),u)* -> equal(u,v) memberP(w,u).
% 8.91/9.12 191[0:Inp] ssList(u) ssList(v) || equal(hd(v),hd(u))* equal(tl(v),tl(u)) -> equal(v,u) equal(nil,v) equal(nil,u).
% 8.91/9.12 193[0:Inp] ssList(u) duplicatefreeP(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 8.91/9.12 202[0:Rew:5.0,12.0] || neq(sk2,nil)* -> ssList(sk7).
% 8.91/9.12 203[0:Rew:5.0,11.0] || neq(sk2,nil)* -> ssItem(sk6).
% 8.91/9.12 204[0:Rew:6.0,10.1,5.0,10.0] || equal(nil,sk2)** -> equal(nil,sk1).
% 8.91/9.12 205[0:Rew:5.0,14.1,5.0,14.0] || neq(sk2,nil) -> equal(app(sk7,cons(sk6,nil)),sk2)**.
% 8.91/9.12 206[0:Rew:6.0,13.1,5.0,13.0] || neq(sk2,nil) -> equal(app(cons(sk6,nil),sk7),sk1)**.
% 8.91/9.12 248[0:Res:7.0,85.0] || memberP(nil,sk5)* -> .
% 8.91/9.12 394[0:Res:2.0,86.0] || -> ssItem(u)* duplicatefreeP(sk2)*.
% 8.91/9.12 409[0:Res:2.0,191.1] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u) equal(nil,sk2).
% 8.91/9.12 448[0:Res:2.0,114.1] ssList(u) || -> equal(sk2,u) neq(sk2,u)*.
% 8.91/9.12 450[0:Res:2.0,100.1] ssItem(u) || -> ssList(cons(u,sk2))*.
% 8.91/9.12 491[1:Spt:86.1] || -> ssItem(u)*.
% 8.91/9.12 495[1:MRR:85.0,491.0] || memberP(nil,u)* -> .
% 8.91/9.12 496[1:MRR:84.0,491.0] || -> cyclefreeP(cons(u,nil))*.
% 8.91/9.12 497[1:MRR:83.0,491.0] || -> totalorderP(cons(u,nil))*.
% 8.91/9.12 498[1:MRR:82.0,491.0] || -> strictorderP(cons(u,nil))*.
% 8.91/9.12 499[1:MRR:81.0,491.0] || -> totalorderedP(cons(u,nil))*.
% 8.91/9.12 500[1:MRR:80.0,491.0] || -> strictorderedP(cons(u,nil))*.
% 8.91/9.12 501[1:MRR:79.0,491.0] || -> duplicatefreeP(cons(u,nil))*.
% 8.91/9.12 502[1:MRR:78.0,491.0] || -> equalelemsP(cons(u,nil))*.
% 8.91/9.12 530[1:MRR:116.1,116.0,491.0] || -> equal(u,v) neq(u,v)*.
% 8.91/9.12 588[1:MRR:155.0,491.0] ssList(u) ssList(v) || memberP(v,w) -> memberP(app(u,v),w)*.
% 8.91/9.12 589[1:MRR:154.0,491.0] ssList(u) ssList(v) || memberP(u,w) -> memberP(app(u,v),w)*.
% 8.91/9.12 590[1:MRR:153.1,153.0,491.0] ssList(u) || memberP(u,v) -> memberP(cons(w,u),v)*.
% 8.91/9.12 591[1:MRR:152.1,152.0,491.0] ssList(u) || equal(v,w) -> memberP(cons(w,u),v)*.
% 8.91/9.12 610[1:MRR:175.1,175.0,491.0] ssList(u) || memberP(cons(v,u),w)* -> equal(w,v) memberP(u,w).
% 8.91/9.12 611[1:MRR:172.0,491.0] ssList(u) ssList(v) || memberP(app(u,v),w)* -> memberP(u,w) memberP(v,w).
% 8.91/9.12 626[1:MRR:100.1,491.0] ssList(u) || -> ssList(cons(v,u))*.
% 8.91/9.12 631[1:MRR:130.1,491.0] ssList(u) || equal(cons(v,nil),u)*+ -> singletonP(u)*.
% 8.91/9.12 632[1:MRR:134.1,491.0] ssList(u) || -> equal(app(cons(v,nil),u),cons(v,u))**.
% 8.91/9.12 689[2:Spt:409.5] || -> equal(nil,sk2)**.
% 8.91/9.12 697[2:Rew:689.0,204.0] || equal(sk2,sk2) -> equal(nil,sk1)**.
% 8.91/9.12 747[2:Rew:689.0,495.0] || memberP(sk2,u)* -> .
% 8.91/9.12 770[2:MRR:8.1,747.0] || -> memberP(sk1,sk5)*.
% 8.91/9.12 788[2:Obv:697.0] || -> equal(nil,sk1)**.
% 8.91/9.12 789[2:Rew:689.0,788.0] || -> equal(sk2,sk1)**.
% 8.91/9.12 879[2:Rew:789.0,747.0] || memberP(sk1,u)* -> .
% 8.91/9.12 885[2:UnC:879.0,770.0] || -> .
% 8.91/9.12 1002[2:Spt:885.0,409.5,689.0] || equal(nil,sk2)** -> .
% 8.91/9.12 1003[2:Spt:885.0,409.0,409.1,409.2,409.3,409.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 8.91/9.12 1024[3:Spt:202.0] || neq(sk2,nil)* -> .
% 8.91/9.12 1041[3:Res:530.1,1024.0] || -> equal(nil,sk2)**.
% 8.91/9.12 1042[3:MRR:1041.0,1002.0] || -> .
% 8.91/9.12 1043[3:Spt:1042.0,202.0,1024.0] || -> neq(sk2,nil)*.
% 8.91/9.12 1044[3:Spt:1042.0,202.1] || -> ssList(sk7)*.
% 8.91/9.12 1045[3:MRR:205.0,1043.0] || -> equal(app(sk7,cons(sk6,nil)),sk2)**.
% 8.91/9.12 1046[3:MRR:206.0,1043.0] || -> equal(app(cons(sk6,nil),sk7),sk1)**.
% 8.91/9.12 1050[4:Spt:8.0] || -> memberP(sk1,sk5)*.
% 8.91/9.12 1051[4:MRR:9.0,1050.0] || memberP(sk2,sk5)* -> .
% 8.91/9.12 1194[1:EqR:631.1] ssList(cons(u,nil)) || -> singletonP(cons(u,nil))*.
% 8.91/9.12 1195[1:SSi:1194.0,626.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,502.0,501.0,500.0,499.0,498.0,497.0,496.1] || -> singletonP(cons(u,nil))*.
% 8.91/9.12 1264[3:SpR:632.1,1046.0] ssList(sk7) || -> equal(cons(sk6,sk7),sk1)**.
% 8.91/9.12 1270[3:SSi:1264.0,1044.0] || -> equal(cons(sk6,sk7),sk1)**.
% 8.91/9.12 1291[3:SpR:1270.0,590.2] ssList(sk7) || memberP(sk7,u)* -> memberP(sk1,u).
% 8.91/9.12 1292[3:SSi:1291.0,1044.0] || memberP(sk7,u)* -> memberP(sk1,u).
% 8.91/9.12 1896[3:SpR:1045.0,588.3] ssList(sk7) ssList(cons(sk6,nil)) || memberP(cons(sk6,nil),u)* -> memberP(sk2,u).
% 8.91/9.12 1899[3:SSi:1896.1,1896.0,626.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,502.0,501.0,500.0,499.0,498.0,497.0,496.0,1195.0,1044.1] || memberP(cons(sk6,nil),u)* -> memberP(sk2,u).
% 8.91/9.12 1921[3:SpR:1046.0,589.3] ssList(cons(sk6,nil)) ssList(sk7) || memberP(cons(sk6,nil),u)* -> memberP(sk1,u).
% 8.91/9.12 1922[3:SpR:1045.0,589.3] ssList(sk7) ssList(cons(sk6,nil)) || memberP(sk7,u)* -> memberP(sk2,u).
% 8.91/9.12 1924[3:SSi:1922.1,1922.0,626.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,502.0,501.0,500.0,499.0,498.0,497.0,496.0,1195.0,1044.1] || memberP(sk7,u)* -> memberP(sk2,u).
% 8.91/9.12 1926[3:SSi:1921.1,1921.0,1044.0,626.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,502.0,501.0,500.0,499.0,498.0,497.0,496.1,1195.0] || memberP(cons(sk6,nil),u)* -> memberP(sk1,u).
% 8.91/9.12 1946[3:SpL:1270.0,610.1] ssList(sk7) || memberP(sk1,u) -> equal(u,sk6) memberP(sk7,u)*.
% 8.91/9.12 1949[3:SSi:1946.0,1044.0] || memberP(sk1,u) -> equal(u,sk6) memberP(sk7,u)*.
% 8.91/9.12 1964[3:Res:591.2,1899.0] ssList(nil) || equal(u,sk6) -> memberP(sk2,u)*.
% 8.91/9.12 1966[3:SSi:1964.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0] || equal(u,sk6) -> memberP(sk2,u)*.
% 8.91/9.12 3031[3:SpL:1045.0,611.2] ssList(sk7) ssList(cons(sk6,nil)) || memberP(sk2,u) -> memberP(sk7,u) memberP(cons(sk6,nil),u)*.
% 8.91/9.12 3038[3:SSi:3031.1,3031.0,626.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,502.0,501.0,500.0,499.0,498.0,497.0,496.0,1195.0,1044.1] || memberP(sk2,u) -> memberP(sk7,u) memberP(cons(sk6,nil),u)*.
% 8.91/9.12 6854[3:Res:1949.2,1924.0] || memberP(sk1,u) -> equal(u,sk6) memberP(sk2,u)*.
% 8.91/9.12 6857[3:MRR:6854.1,1966.0] || memberP(sk1,u) -> memberP(sk2,u)*.
% 8.91/9.12 6863[4:Res:6857.1,1051.0] || memberP(sk1,sk5)* -> .
% 8.91/9.12 6865[4:MRR:6863.0,1050.0] || -> .
% 10.34/10.54 6866[4:Spt:6865.0,8.0,1050.0] || memberP(sk1,sk5)* -> .
% 10.34/10.54 6867[4:Spt:6865.0,8.1] || -> memberP(sk2,sk5)*.
% 10.34/10.54 9158[3:Res:3038.2,1926.0] || memberP(sk2,u) -> memberP(sk7,u)* memberP(sk1,u).
% 10.34/10.54 9162[3:MRR:9158.1,1292.0] || memberP(sk2,u)* -> memberP(sk1,u).
% 10.34/10.54 9186[4:Res:6867.0,9162.0] || -> memberP(sk1,sk5)*.
% 10.34/10.54 9189[4:MRR:9186.0,6866.0] || -> .
% 10.34/10.54 9192[1:Spt:9189.0,86.0,86.2] ssList(u) || -> duplicatefreeP(u)*.
% 10.34/10.54 9204[1:MRR:193.1,9192.1] ssList(u) ssItem(v) ssList(w) ssList(x) ssList(y) || equal(app(app(w,cons(v,x)),cons(v,y)),u)* -> .
% 10.34/10.54 9281[2:Spt:394.0] || -> ssItem(u)*.
% 10.34/10.54 9416[2:MRR:100.1,9281.0] ssList(u) || -> ssList(cons(v,u))*.
% 10.34/10.54 9438[2:MRR:9204.1,9281.0] ssList(u) ssList(v) ssList(w) ssList(x) || equal(app(app(v,cons(y,w)),cons(y,x)),u)* -> .
% 10.34/10.54 9472[2:MRR:171.2,9281.0] ssList(u) ssList(v) || -> equal(app(cons(w,v),u),cons(w,app(v,u)))**.
% 10.34/10.54 11829[2:SpR:9472.2,99.2] ssList(u) ssList(v) ssList(cons(w,v)) ssList(u) || -> ssList(cons(w,app(v,u)))*.
% 10.34/10.54 11872[2:Obv:11829.0] ssList(u) ssList(cons(v,u)) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 10.34/10.54 11873[2:SSi:11872.1,9416.1] ssList(u) ssList(v) || -> ssList(cons(w,app(u,v)))*.
% 10.34/10.54 13274[2:EqR:9438.4] ssList(app(app(u,cons(v,w)),cons(v,x))) ssList(u) ssList(w) ssList(x) || -> .
% 10.34/10.54 13302[2:SSi:13274.0,99.1,99.1,9416.2,9416.2] ssList(u) ssList(v) ssList(w) || -> .
% 10.34/10.54 13314[2:MRR:11873.2,13302.2] ssList(u) ssList(v) || -> .
% 10.34/10.54 13328[2:Con:13314.1] ssList(u) || -> .
% 10.34/10.54 13329[2:UnC:13328.0,2.0] || -> .
% 10.34/10.54 13356[2:Spt:13329.0,394.1] || -> duplicatefreeP(sk2)*.
% 10.34/10.54 13358[3:Spt:409.5] || -> equal(nil,sk2)**.
% 10.34/10.54 13465[3:Rew:13358.0,248.0] || memberP(sk2,sk5)* -> .
% 10.34/10.54 13475[3:Rew:13358.0,204.0] || equal(sk2,sk2) -> equal(nil,sk1)**.
% 10.34/10.54 13516[3:MRR:8.1,13465.0] || -> memberP(sk1,sk5)*.
% 10.34/10.54 13532[3:Obv:13475.0] || -> equal(nil,sk1)**.
% 10.34/10.54 13533[3:Rew:13358.0,13532.0] || -> equal(sk2,sk1)**.
% 10.34/10.54 13652[3:Rew:13533.0,13465.0] || memberP(sk1,sk5)* -> .
% 10.34/10.54 13659[3:MRR:13652.0,13516.0] || -> .
% 10.34/10.54 13878[3:Spt:13659.0,409.5,13358.0] || equal(nil,sk2)** -> .
% 10.34/10.54 13879[3:Spt:13659.0,409.0,409.1,409.2,409.3,409.4] ssList(u) || equal(hd(u),hd(sk2))* equal(tl(u),tl(sk2)) -> equal(u,sk2) equal(nil,u).
% 10.34/10.54 13920[4:Spt:202.0] || neq(sk2,nil)* -> .
% 10.34/10.54 14012[4:Res:448.2,13920.0] ssList(nil) || -> equal(nil,sk2)**.
% 10.34/10.54 14013[4:SSi:14012.0,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0] || -> equal(nil,sk2)**.
% 10.34/10.54 14014[4:MRR:14013.0,13878.0] || -> .
% 10.34/10.54 14015[4:Spt:14014.0,202.0,13920.0] || -> neq(sk2,nil)*.
% 10.34/10.54 14016[4:Spt:14014.0,202.1] || -> ssList(sk7)*.
% 10.34/10.54 14017[4:MRR:203.0,14015.0] || -> ssItem(sk6)*.
% 10.34/10.54 17374[0:SpR:171.3,99.2] ssList(u) ssList(v) ssItem(w) ssList(cons(w,v)) ssList(u) || -> ssList(cons(w,app(v,u)))*.
% 10.34/10.54 17410[0:Obv:17374.0] ssList(u) ssItem(v) ssList(cons(v,u)) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 10.34/10.54 17411[0:SSi:17410.2,100.2] ssList(u) ssItem(v) ssList(w) || -> ssList(cons(v,app(u,w)))*.
% 10.34/10.54 19967[1:EqR:9204.5] ssList(app(app(u,cons(v,w)),cons(v,x))) ssItem(v) ssList(u) ssList(w) ssList(x) || -> .
% 10.34/10.54 19997[1:SSi:19967.0,99.2,99.2,100.2,100.2] ssItem(u) ssList(v) ssList(w) ssList(x) || -> .
% 10.34/10.54 19998[1:MRR:17411.3,19997.1] ssList(u) ssItem(v) ssList(w) || -> .
% 10.34/10.54 20001[1:Con:19998.2] ssList(u) ssItem(v) || -> .
% 10.34/10.54 20002[1:MRR:450.1,20001.0] ssItem(u) || -> .
% 10.34/10.54 20003[4:UnC:20002.0,14017.0] || -> .
% 10.34/10.54 % SZS output end Refutation
% 10.34/10.54 Formulae used in the proof : co1_2 co1_5 co1_6 co1_7 co1_8 co1_9 co1_10 co1_11 co1_12 co1_13 co1_14 clause1 clause2 clause3 clause4 clause5 clause6 clause7 clause8 clause64 clause65 clause66 clause67 clause68 clause69 clause70 clause71 clause72 clause85 clause86 clause100 clause102 clause116 clause120 clause138 clause139 clause140 clause141 clause157 clause158 clause161 clause177 clause179
% 10.34/10.54
%------------------------------------------------------------------------------